Sciweavers

1521 search results - page 37 / 305
» On Sampled Semantics of Timed Systems
Sort
View
POPL
2006
ACM
14 years 11 months ago
Adventures in time and space
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...
Norman Danner, James S. Royer
RTAS
2008
IEEE
14 years 5 months ago
Using Trace Scratchpads to Reduce Execution Times in Predictable Real-Time Architectures
Instruction scratchpads have been previously suggested as a way to reduce the worst case execution time (WCET) of hard real-time programs without introducing the analysis issues p...
Jack Whitham, Neil C. Audsley
FM
2009
Springer
146views Formal Methods» more  FM 2009»
13 years 8 months ago
Verifying Real-Time Systems against Scenario-Based Requirements
Abstract. We propose an approach to automatic verification of realtime systems against scenario-based requirements. A real-time system is modeled as a network of Timed Automata (TA...
Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, S...
RTSS
1999
IEEE
14 years 3 months ago
Specification and Analysis of Soft Real-Time Systems: Quantity and Quality
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
Pedro R. D'Argenio, Joost-Pieter Katoen, Ed Brinks...
ENTCS
2008
83views more  ENTCS 2008»
13 years 11 months ago
Executable Specifications for Real-Time Distributed Systems
One of the challenges in designing distributed, embedded systems is the paucity of formal, executable specification notations that provide support for both real-time and asynchron...
Arnab Ray, Rance Cleaveland