Publicaties
Gekozen filters:
Gekozen filters:
Contributions in Programming Languages Theory: Logical Relations and Type Theory KU Leuven
Software systems are ubiquitous. Failure in safety- and security-critical systems, e.g., the control system of a passenger plane, can be quite catastrophic. Hence, it is crucial to ensure that safety- and security-critical software systems are correct. Types play an important role in helping us achieve this goal. They help compilers check for (some) programmer's mistakes. They also form the basis of a group of proof assistants. A proof assistant ...
PLPV '14: Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages Meets Program Verification KU Leuven
Welcome to the 8th edition of Programming Languages meets Program Verification (PLPV). The PLPV series of workshops aims to bring together researchers working in the intersection of programming languages and program verification. Relevant topics include, but are not limited to, types, contracts, interactive theorem proving, model checking, and program analysis. A common theme of work in this area is to make program verification easier through ...
Trading off complexity for expressiveness in programming languages Universiteit Antwerpen
When programming resource-scarce embedded smart devices, the designer often requires both the low-level system programming features of a language such as C and higher level capability typical of a language like Java. The choice of a particular language typically implies trade offs between conflicting design goals such as performance, costs, and overheads. The large variety of languages, virtual machines, and translators provides the designer ...
Criteria, Challenges and Opportunities for Gesture Programming Languages Vrije Universiteit Brussel
An increasing number of today’s consumer devices such as
mobile phones or tablet computers are equipped with various
sensors. The extraction of useful information such as ges-
tures from sensor-generated data based on mainstream im-
perative languages is a notoriously difficult task. Over the
last few years, a number of domain-specific programming
languages have been proposed to ease the development of ...
mobile phones or tablet computers are equipped with various
sensors. The extraction of useful information such as ges-
tures from sensor-generated data based on mainstream im-
perative languages is a notoriously difficult task. Over the
last few years, a number of domain-specific programming
languages have been proposed to ease the development of ...
A meta-level architecture for stream-based programming languages and its applications in cyber-physical systems Vrije Universiteit Brussel
Contemporary computer networks no longer consist of mainframes and desktop computers. Due to the miniaturization and mass production of computer chips, it has become feasible to embed computers into everyday objected, creating their“digital twin”. The digital twin is causally connected to its physical counterpart;changes in the digital twin affect the physical device and vice versa. A network of digital twins is called a Cyber-Physical System ...
MCMC estimation of conditional probabilities in probabilistic programming languages KU Leuven
Probabilistic logic programming languages are powerful formalisms that can model complex problems where it is necessary to represent both structure and uncertainty. Using exact inference methods to compute conditional probabilities in these languages is often intractable so approximate inference techniques are necessary. This paper proposes a Markov Chain Monte Carlo algorithm for estimating conditional probabilities based on sampling from an ...
Towards Programming Languages for Machine Learning and Data Mining (Extended Abstract) KU Leuven
Today there is only little support for developing software that incorporates a machine learning or a data mining component. To alleviate this situation, we propose to develop programming languages for machine learning and data mining. We also argue that such languages should be declarative and should be based on constraint programming modeling principles. In this way, one could declaratively specify the problem of machine learning or data mining ...
Fast type reconstruction for dynamically typed programming languages KU Leuven
Type inference and type reconstruction derive static types for program elements that have no static type associated with them. They have a wide range of usage, such as helping to eliminate the burden of manually specifying types, verifying whether a program is type-safe, helping to produce more optimized code or helping to understand programs. While type inference and type reconstruction is an active field of research, most existing techniques ...