Sciweavers

4719 search results - page 266 / 944
» Newtonian program analysis
Sort
View
144
Voted
SCAM
2007
IEEE
16 years 4 days ago
Extending Attribute Grammars with Collection Attributes--Evaluation and Applications
Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...
Eva Magnusson, Torbjörn Ekman, Görel Hed...
WORDS
2002
IEEE
15 years 10 months ago
Writing Temporally Predictable Code
The Worst-Case Execution-Time Analysis (WCET Analysis) of program code that is to be executed on modern processors is a highly complex task. First, it involves path analysis, to i...
Peter P. Puschner, Alan Burns
SAS
2007
Springer
112views Formal Methods» more  SAS 2007»
15 years 12 months ago
Taming the Wrapping of Integer Arithmetic
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
Axel Simon, Andy King
ICTCS
2005
Springer
15 years 11 months ago
Error Mining for Regular Expression Patterns
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
Giuseppe Castagna, Dario Colazzo, Alain Frisch
ESOP
2007
Springer
16 years 1 days ago
Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts
The goal of our research project is to establish a type-based method for verification of certain critical properties (such as deadlockand race-freedom) of operating system kernels...
Kohei Suenaga, Naoki Kobayashi