Sciweavers

309 search results - page 47 / 62
» Termination proofs for systems code
Sort
View
LPAR
2010
Springer
13 years 5 months ago
Verifying Pointer and String Analyses with Region Type Systems
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
APSEC
2009
IEEE
13 years 5 months ago
A Formal Framework to Integrate Timed Security Rules within a TEFSM-Based System Specification
Abstract--Formal methods are very useful in software industry and are becoming of paramount importance in practical engineering techniques. They involve the design and the modeling...
Wissam Mallouli, Amel Mammar, Ana R. Cavalli
DNA
2011
Springer
233views Bioinformatics» more  DNA 2011»
12 years 7 months ago
Less Haste, Less Waste: On Recycling and Its Limits in Strand Displacement Systems
We study the potential for molecule recycling in chemical reaction systems and their DNA strand displacement realizations. Recycling happens when a product of one reaction is a rea...
Anne Condon, Alan J. Hu, Ján Manuch, Chris ...
PPOPP
2010
ACM
14 years 4 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
ENTCS
2007
126views more  ENTCS 2007»
13 years 7 months ago
Context Dependent Procedures and Computed Types in -eriFun
We present two enhancements of the functional language L which is used in the eriFun system to write programs and formulate statements about them. Context dependent procedures all...
Andreas Schlosser, Christoph Walther, Michael Gond...