Sciweavers

54 search results - page 8 / 11
» Checking Secrecy by Means of Partial Order Reduction
Sort
View
SEFM
2009
IEEE
15 years 4 months ago
Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
ELP
1991
15 years 1 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning
SIGSOFT
2009
ACM
15 years 10 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
EMSOFT
2008
Springer
14 years 11 months ago
Interface theories with component reuse
Interface theories have been proposed to support incremental design and independent implementability. Incremental design means that the compatibility checking of interfaces can pr...
Laurent Doyen, Thomas A. Henzinger, Barbara Jobstm...
EDBT
2009
ACM
117views Database» more  EDBT 2009»
15 years 26 days ago
A methodology for preference-based personalization of contextual data
The widespread use of mobile appliances, with limitations in terms of storage, power, and connectivity capability, requires to minimize the amount of data to be loaded on user’s...
Antonio Miele, Elisa Quintarelli, Letizia Tanca