Sciweavers

1465 search results - page 60 / 293
» Making the Correct Mistakes
Sort
View
APN
2006
Springer
15 years 1 months ago
Invariant Based Programming
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...
Ralph-Johan Back
TIME
2007
IEEE
15 years 6 months ago
Automated Natural Deduction for Propositional Linear-Time Temporal Logic
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin
TPHOL
2005
IEEE
15 years 5 months ago
Verifying a Secure Information Flow Analyzer
Abstract. Denotational semantics for a substantial fragment of Java is formalized by deep embedding in PVS, making extensive use of dependent types. A static analyzer for secure in...
David A. Naumann
AIML
2004
15 years 1 months ago
On the Modularity of Theories
In this paper we give the notion of modularity of a theory and analyze some of its properties, especially for the case of action theories in reasoning about actions. We propose alg...
Andreas Herzig, Ivan José Varzinczak
ACL
1992
15 years 1 months ago
Tense Trees as the "Fine Structure" of Discourse
We present a new compositional tense-aspect deindexing mechanism that makes use of tense trees as components of discourse contexts. The mechanism allows reference episodes to be c...
Chung Hee Hwang, Lenhart K. Schubert