Sciweavers

3044 search results - page 304 / 609
» Linear logical approximations
Sort
View
156
Voted
PODS
2003
ACM
118views Database» more  PODS 2003»
16 years 6 months ago
Numerical document queries
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries,...
Helmut Seidl, Thomas Schwentick, Anca Muscholl
CSL
2007
Springer
16 years 27 days ago
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
TACAS
2005
Springer
98views Algorithms» more  TACAS 2005»
16 years 6 days ago
Monte Carlo Model Checking
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...
Radu Grosu, Scott A. Smolka
SIGSOFT
2003
ACM
15 years 12 months ago
Fluent model checking for event-based systems
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
Dimitra Giannakopoulou, Jeff Magee
CONCUR
1999
Springer
15 years 11 months ago
Robust Satisfaction
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
Orna Kupferman, Moshe Y. Vardi