Sciweavers

1027 search results - page 92 / 206
» Callgraph properties of executables
Sort
View
PLILP
1993
Springer
15 years 5 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
HYBRID
2009
Springer
15 years 4 months ago
Trajectory Based Verification Using Local Finite-Time Invariance
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
A. Agung Julius, George J. Pappas
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 4 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
DATE
2004
IEEE
130views Hardware» more  DATE 2004»
15 years 4 months ago
Utilizing Formal Assertions for System Design of Network Processors
System level modeling with executable languages such as C/C++ has been crucial in the development of large electronic systems from general processors to application specific desig...
Xi Chen, Yan Luo, Harry Hsieh, Laxmi N. Bhuyan, Fe...
DSN
2004
IEEE
15 years 4 months ago
Model Checking Action- and State-Labelled Markov Chains
In this paper we introduce the logic asCSL, an extension of continuous stochastic logic (CSL), which provides powerful means to characterise execution paths of action- and state-l...
Christel Baier, Lucia Cloth, Boudewijn R. Haverkor...