Sciweavers

294 search results - page 34 / 59
» Formal Verification of the Implementability of Timing Requir...
Sort
View
IPPS
1996
IEEE
14 years 19 days ago
Self-Timed Resynchronization: A Post-Optimization for Static Multiprocessor Schedules
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant -that is, their corresponding sequencing requirements are enforced c...
Shuvra S. Bhattacharyya, Sundararajan Sriram, Edwa...
ENTCS
2006
168views more  ENTCS 2006»
13 years 8 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
CCS
2008
ACM
13 years 10 months ago
Minimal backups of cryptographic protocol runs
As cryptographic protocols execute they accumulate information such as values and keys, and evidence of properties about this information. As execution proceeds, new information b...
Jay A. McCarthy, Shriram Krishnamurthi
ICFP
2005
ACM
14 years 8 months ago
A computational approach to reflective meta-reasoning about languages with bindings
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
Aleksey Nogin, Alexei Kopylov, Xin Yu, Jason Hicke...
ECOWS
2008
Springer
13 years 10 months ago
Beyond Soundness: On the Semantic Consistency of Executable Process Models
Executable business process models build on the specification of process activities, their implemented business functions (e.g., Web services) and the control flow between these a...
Ingo Weber, Jörg Hoffmann, Jan Mendling