Sciweavers

407 search results - page 26 / 82
» Malleable Proof Systems and Applications
Sort
View
AAAI
2010
13 years 9 months ago
A Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretical...
Gilles Audemard, George Katsirelos, Laurent Simon
ENTCS
2006
112views more  ENTCS 2006»
13 years 7 months ago
Modeling Web Applications by the Multiple Levels of Integrity Policy
We propose a formal method to validate the reliability of a web application, by modeling interactions among its constituent objects. Modeling exploits the recent "Multiple Le...
Gianluca Amato, Massimo Coppola, Stefania Gnesi, F...
FLOPS
2010
Springer
14 years 2 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka
VMCAI
2004
Springer
14 years 27 days ago
Liveness with Invisible Ranking
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
ICCHP
2010
Springer
14 years 10 days ago
A Mobile Phone Application Enabling Visually Impaired Users to Find and Read Product Barcodes
Abstract. While there are many barcode readers available for identifying products in a supermarket or at home on mobile phones (e.g., Red Laser iPhone app), such readers are inacce...
Ender Tekin, James M. Coughlan