Sciweavers

309 search results - page 58 / 62
» Termination proofs for systems code
Sort
View
ICNP
2006
IEEE
14 years 1 months ago
Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
Adam Biltcliffe, Michael Dales, Sam Jansen, Tom Ri...
DATE
2002
IEEE
123views Hardware» more  DATE 2002»
14 years 18 days ago
False Path Elimination in Quasi-Static Scheduling
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
G. Arrigoni, L. Duchini, Claudio Passerone, Lucian...
KR
2000
Springer
13 years 11 months ago
A Logic Based Language for Parametric Inheritance
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...
Hasan M. Jamil
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 7 months ago
Continuation-Passing C, compiling threads to events through continuations
Abstract In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented t...
Gabriel Kerneis, Juliusz Chroboczek
TCS
2010
13 years 6 months ago
Arrows for secure information flow
This paper presents an embedded security sublanguage for enforcing informationflow policies in the standard Haskell programming language. The sublanguage provides useful informat...
Peng Li, Steve Zdancewic