Sciweavers

1446 search results - page 198 / 290
» Formal analysis of hardware requirements
Sort
View
ENTCS
2007
124views more  ENTCS 2007»
13 years 8 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
PR
2006
84views more  PR 2006»
13 years 8 months ago
Clustering techniques for protein surfaces
Though most approaches to protein comparison are based on their structure, several studies produced evidence of a strict correlation between the surface characteristics of protein...
Lorenzo Baldacci, Matteo Golfarelli, Alessandra Lu...
IFIP
2010
Springer
13 years 3 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
14 years 27 days ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston
DAC
2009
ACM
14 years 9 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke