Sciweavers

279 search results - page 44 / 56
» Abstraction and refinement techniques in automated design de...
Sort
View
CADE
2007
Springer
14 years 8 months ago
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
Yeting Ge, Clark Barrett, Cesare Tinelli
ATAL
2008
Springer
13 years 10 months ago
A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding progr
We present Tartanian, a game theory-based player for headsup no-limit Texas Hold'em poker. Tartanian is built from three components. First, to deal with the virtually infinit...
Andrew Gilpin, Tuomas Sandholm, Troels Bjerre S&os...
LICS
2006
IEEE
14 years 2 months ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon
WWW
2008
ACM
14 years 9 months ago
Wishful search: interactive composition of data mashups
With the emergence of Yahoo Pipes and several similar services, data mashup tools have started to gain interest of business users. Making these tools simple and accessible to user...
Anton Riabov, Eric Bouillet, Mark Feblowitz, Zhen ...
POPL
2010
ACM
14 years 5 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies