Sciweavers

116 search results - page 8 / 24
» Automatic Abstraction for Intervals Using Boolean Formulae
Sort
View
SEFM
2008
IEEE
15 years 4 months ago
Nullness Analysis in Boolean Form
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
Fausto Spoto
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
14 years 9 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...
DLT
2010
14 years 11 months ago
Around Dot Depth Two
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
14 years 8 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
HYBRID
2000
Springer
15 years 1 months ago
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
Abstract. Sincehybridembeddedsystemsarepervasiveandoftensafetycritical, guarantees about their correct performance are desirable. The hybrid systemsmodelcheckerHyTech providessuch ...
Thomas A. Henzinger, Benjamin Horowitz, Rupak Maju...