1894 search results - page 154 / 379 » A TLA Proof System |
148
Voted
OSDI
1996
ACM
15 years 5 months ago
1996
ACM
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
115
click to vote
VMCAI
2010
Springer
16 years 1 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
114
Voted
DIAGRAMS
2000
Springer
15 years 8 months ago
2000
Springer
This paper gives a brief overview of FG, a formal system for doing Euclidean geometry whose basic syntactic elements are geometric diagrams, and which has been implimentented as th...
113
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. There are many examples of intelligent and learning systems that are based either on the connectionist or the symbolic approach. Although the latter can be successfully c...
130
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...