Sciweavers

728 search results - page 118 / 146
» A Logical Approach to Represent and Reason about Calendars
Sort
View
CSL
2010
Springer
13 years 8 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
TACAS
2010
Springer
212views Algorithms» more  TACAS 2010»
13 years 5 months ago
Assume-Guarantee Verification for Probabilistic Systems
Abstract. We present a compositional verification technique for systems that exhibit both probabilistic and nondeterministic behaviour. We adopt an assume-guarantee approach to ver...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 5 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
HICSS
2007
IEEE
139views Biometrics» more  HICSS 2007»
14 years 2 months ago
Ontology Driven CPG Authoring and Execution via a Semantic Web Framework
Clinical Practice Guidelines (CPG) are used by healthcare practitioners to standardize clinical practice and to provide evidence mediated health-care. Currently, there have been c...
Sajjad Hussain, Syed Sibte Raza Abidi
PEPM
2009
ACM
14 years 4 months ago
Bidirectional data-flow analyses, type-systematically
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
Maria João Frade, Ando Saabas, Tarmo Uustal...