Sciweavers

622 search results - page 68 / 125
» Answer Set Programming and Bounded Model Checking
Sort
View
FOCS
2010
IEEE
13 years 6 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
AOSD
2009
ACM
13 years 10 months ago
Modular verification of dynamically adaptive systems
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
Ji Zhang, Heather Goldsby, Betty H. C. Cheng
ENTCS
2006
172views more  ENTCS 2006»
13 years 8 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
ISQED
2007
IEEE
152views Hardware» more  ISQED 2007»
14 years 2 months ago
Variation Aware Timing Based Placement Using Fuzzy Programming
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
Venkataraman Mahalingam, N. Ranganathan
ICFP
2012
ACM
11 years 10 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens