Sciweavers

290 search results - page 47 / 58
» Logical Properties of Name Restriction
Sort
View
CADE
2005
Springer
14 years 10 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
LICS
1994
IEEE
14 years 2 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
ICFP
2003
ACM
14 years 10 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
SGAI
2007
Springer
14 years 4 months ago
Extending Jess to Handle Uncertainty
Computer scientists are often faced with the challenge of having to model the world and its associated uncertainties. One area in particular where modelling uncertainty is importa...
David Corsar, Derek H. Sleeman, Anne McKenzie
CSL
2000
Springer
14 years 2 months ago
Composition and Submachine Concepts for Sequential ASMs
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
Egon Börger, Joachim Schmid