Sciweavers

46 search results - page 5 / 10
» Satisfiability Modulo the Theory of Costs: Foundations and A...
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
LICS
2009
IEEE
14 years 1 months ago
The Structure of First-Order Causality
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
Samuel Mimram
INFORMATIKTAGE
2008
13 years 7 months ago
Constraint Based Transformation Theory
During the last 25 years the complexity and functionality of software systems has increased dramatically. Software systems have to be updated and restructured continuously [22]. I...
Stefan Natelberg
FASE
2009
Springer
13 years 10 months ago
Certification of Smart-Card Applications in Common Criteria
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
Iman Narasamdya, Michaël Périn
CAV
1999
Springer
92views Hardware» more  CAV 1999»
13 years 10 months ago
Latency Insensitive Protocols
The theory of latency insensitive design is presented as the foundation of a new correct by construction methodology to design very large digital systems by assembling blocks of In...
Luca P. Carloni, Kenneth L. McMillan, Alberto L. S...