357 search results - page 60 / 72 » Specifying and Verifying Fault-Tolerant Systems |
DLS
2009
13 years 5 months ago
2009
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 ...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
RTSS
1998
IEEE
13 years 12 months ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...