Sciweavers

309 search results - page 39 / 62
» Termination proofs for systems code
Sort
View
133
Voted
FTRTFT
1998
Springer
15 years 6 months ago
Operational and Logical Semantics for Polling Real-Time Systems
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...
Henning Dierks, Ansgar Fehnker, Angelika Mader, Fr...
123
Voted
PLDI
2004
ACM
15 years 7 months ago
Kill-safe synchronization abstractions
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...
Matthew Flatt, Robert Bruce Findler
91
Voted
IWMM
2004
Springer
92views Hardware» more  IWMM 2004»
15 years 7 months ago
Memory accounting without partitions
Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be te...
Adam Wick, Matthew Flatt
202
Voted
CADE
2011
Springer
14 years 1 months ago
Static Analysis of Android Programs
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
Étienne Payet, Fausto Spoto
ESOP
2001
Springer
15 years 6 months ago
Typestate Checking of Machine Code
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
Zhichen Xu, Thomas W. Reps, Barton P. Miller