Sciweavers

5326 search results - page 735 / 1066
» On what we can ensure
Sort
View

Lecture Notes
4961views
17 years 4 months ago
The Relational Data Model, Normalisation and effective Database Design
I have been designing and building applications, including the databases used by those applications, for several decades now. I have seen similar problems approached by different d...
Tony Marston
GTTSE
2007
Springer
16 years 26 days ago
Model Transformations for the Compilation of Multi-processor Systems-on-Chip
With the increase of amount of transistors which can be contained on a chip and the constant expectation for more sophisticated applications, the design of Systems-on-Chip (SoC) is...
Éric Piel, Philippe Marquet, Jean-Luc Dekey...
USS
2008
15 years 9 months ago
Verifying Compliance of Trusted Programs
In this paper, we present an approach for verifying that trusted programs correctly enforce system security goals when deployed. A trusted program is trusted to only perform safe ...
Sandra Rueda, Dave King 0002, Trent Jaeger
CSL
2010
Springer
15 years 7 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
185
Voted
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 5 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise