1818 search results - page 238 / 364 » Granularity-Adaptive Proof Presentation |
139
click to vote
ICFP
2000
ACM
15 years 8 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
119
Voted
CAV
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
150
click to vote
CADE
2003
Springer
16 years 4 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
107
Voted
CADE
2001
Springer
16 years 4 months ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
116
Voted
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...