Sciweavers

504 search results - page 55 / 101
» Explaining Verification Conditions
Sort
View
ENTCS
2006
137views more  ENTCS 2006»
13 years 8 months ago
An Efficient Method for Computing Exact State Space of Petri Nets With Stopwatches
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
Morgan Magnin, Didier Lime, Olivier H. Roux
JUCS
2008
189views more  JUCS 2008»
13 years 7 months ago
Structural Performance Evaluation of Multi-Agent Systems
: This paper is dedicated to the issue of structural performance of multi-agent platforms. Due to the wide range of all available architectures, we have concentrated only on Java R...
Dariusz Król, Michal Zelmozer
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
13 years 7 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
ISAMI
2010
13 years 5 months ago
Employing Compact Intra-genomic Language Models to Predict Genomic Sequences and Characterize Their Entropy
Probabilistic models of languages are fundamental to understand and learn the profile of the subjacent code in order to estimate its entropy, enabling the verification and predicti...
Sérgio A. D. Deusdado, Paulo Carvalho
POPL
2008
ACM
14 years 8 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...