Sciweavers

3081 search results - page 233 / 617
» A Formal Ontology of Properties
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 7 months ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty
BIRTHDAY
2010
Springer
15 years 3 months ago
Quantitative Simulation Games
Abstract. Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. The classical view part...
Pavol Cerný, Thomas A. Henzinger, Arjun Rad...
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 6 months ago
Verification of communicating data-driven web services
We study the verification of compositions of Web Service peers which interact asynchronously by exchanging messages. Each peer has access to a local database and reacts to user in...
Alin Deutsch, Liying Sui, Victor Vianu, Dayou Zhou
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
16 years 2 days ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
15 years 10 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider