Sciweavers

2145 search results - page 280 / 429
» Lax Logical Relations
Sort
View
SIGSOFT
2007
ACM
14 years 8 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
WWW
2006
ACM
14 years 8 months ago
Model-based version and configuration management for a web engineering lifecycle
During a lifecycle of a large-scale Web application, Web developers produce a wide variety of inter-related Web objects. Following good Web engineering practice, developers often ...
Tien Nhut Nguyen
RECOMB
2005
Springer
14 years 8 months ago
The Factor Graph Network Model for Biological Systems
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 8 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula