Sciweavers

292 search results - page 43 / 59
» Abstract and Model Check While You Prove
Sort
View
BSL
2004
110views more  BSL 2004»
13 years 7 months ago
Notes on quasiminimality and excellence
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...
John T. Baldwin
ATVA
2006
Springer
114views Hardware» more  ATVA 2006»
13 years 11 months ago
Selective Approaches for Solving Weak Games
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
Malte Helmert, Robert Mattmüller, Sven Schewe
TAPSOFT
1997
Springer
13 years 12 months ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
PLDI
2012
ACM
11 years 10 months ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa