Sciweavers

Share
26 search results - page 4 / 6
» sat 2011
Sort
View
ECOOP
2011
Springer
7 years 9 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program veriļ¬cation, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller
NC
2011
175views Neural Networks» more  NC 2011»
8 years 4 months ago
P systems with active membranes: trading time for space
We consider recognizer P systems having three polarizations associated to the membranes, and we show that they are able to solve the PSPACEcomplete problem Quantified 3SAT when wo...
Antonio E. Porreca, Alberto Leporati, Giancarlo Ma...
NFM
2011
303views Formal Methods» more  NFM 2011»
8 years 3 months ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
CADE
2011
Springer
7 years 9 months ago
Exploiting Symmetry in SMT Problems
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
David Déharbe, Pascal Fontaine, Stephan Mer...
FROCOS
2011
Springer
7 years 9 months ago
Automatic Proof and Disproof in Isabelle/HOL
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
Jasmin Christian Blanchette, Lukas Bulwahn, Tobias...
books