827 search results - page 17 / 166 » Proof-Theoretic Soundness and Completeness |
PLDI
2003
ACM
14 years 27 days ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
ECOWS
2008
Springer
13 years 9 months ago
2008
Springer
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
PODC
2012
ACM
11 years 10 months ago
2012
ACM
The BGP (Border Gateway Protocol) is the single inter-domain routing protocol that enables network operators within each autonomous system (AS) to influence routing decisions by ...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...