Sciweavers

1304 search results - page 100 / 261
» Model Checking C Programs Using F-SOFT
Sort
View
FOSSACS
2007
Springer
15 years 9 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
175
Voted
ECBS
1996
IEEE
155views Hardware» more  ECBS 1996»
15 years 7 months ago
Model-Integrated Program Synthesis Environment
In this paper, it is shown that, through the use of Model-Integrated Program Synthesis MIPS, parallel real-time implementations of image processing data ows can be synthesized fro...
Janos Sztipanovits, Gabor Karsai, Hubertus Franke
OOPSLA
2005
Springer
15 years 8 months ago
Fine-grained interoperability through mirrors and contracts
As a value flows across the boundary between interoperating languages, it must be checked and converted to fit the types and representations of the target language. For simple f...
Kathryn E. Gray, Robert Bruce Findler, Matthew Fla...
109
Voted
SP
2003
IEEE
104views Security Privacy» more  SP 2003»
15 years 8 months ago
Using Replication and Partitioning to Build Secure Distributed Systems
A challenging unsolved security problem is how to specify and enforce system-wide security policies; this problem is even more acute in distributed systems with mutual distrust. T...
Lantian Zheng, Stephen Chong, Andrew C. Myers, Ste...
ENTCS
2006
114views more  ENTCS 2006»
15 years 2 months ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers