1894 search results - page 103 / 379 » A TLA Proof System |
130
Voted
AIML
2006
15 years 2 months ago
2006
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
119
click to vote
ENTCS
2008
15 years 26 days ago
2008
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
109
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper investigates the properties of social choice functions that represent resource allocation strategies in interference coupled wireless systems. The allocated resources ca...
80
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
VCC is an industrial-strength verification environment for low-level concurrent system code written in C. VCC takes a program (annotated with function contracts, state assertions,...
128
click to vote
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...