Sciweavers

4286 search results - page 439 / 858
» Formalizing Service Interactions
Sort
View
FROCOS
2009
Springer
16 years 1 months ago
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas natur...
Stéphane Lescuyer, Sylvain Conchon
ATVA
2007
Springer
101views Hardware» more  ATVA 2007»
16 years 29 days ago
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
Abstract. The emerging technology of interacting systems calls for new forto ensure their reliability. Concurrent games are paradigmatic abstract models for which several logics ha...
Sophie Pinchinat
DATE
2005
IEEE
164views Hardware» more  DATE 2005»
16 years 11 days ago
Automated Synthesis of Assertion Monitors using Visual Specifications
Automated synthesis of monitors from high-level properties plays a significant role in assertion-based verification. We present here a methodology to synthesize assertion monitors...
Ambar A. Gadkari, S. Ramesh
DIAGRAMS
2004
Springer
16 years 5 days ago
An Experimental Comparison of Diagrammatic and Algebraic Logics
Abstract. We have developed a diagrammatic logic for theorem proving, focusing on the domain of metric-space analysis (a geometric domain, but traditionally taught using a dry alge...
Daniel Winterstein, Alan Bundy, Corin A. Gurr, Mat...
CSB
2003
IEEE
111views Bioinformatics» more  CSB 2003»
16 years 2 days ago
A Contradiction-Based Framework for Testing Gene Regulation Hypotheses
We have developed a mathematical framework for representing and testing hypotheses about gene, protein, and signaling molecule interactions. It takes a hierarchical, contradiction...
Steve Racunas, Nigam Shah, Nina V. Fedoroff