Sciweavers

295 search results - page 36 / 59
» SAT, SMT and Applications
Sort
View
OOPSLA
2010
Springer
15 years 10 days ago
A simple inductive synthesis methodology and its applications
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
Shachar Itzhaky, Sumit Gulwani, Neil Immerman, Moo...
WCET
2003
15 years 3 months ago
Challenges in Calculating the WCET of a Complex On-board Satellite Application
Calculating the WCET of mission-critical satellite applications is a challenging issue. The European Space Agency is currently undertaking the CryoSat mission, consisting of a rad...
Manuel Rodríguez, Nuno Silva, João E...
CADE
2002
Springer
16 years 2 months ago
The Quest for Efficient Boolean Satisfiability Solvers
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
Lintao Zhang, Sharad Malik
SAT
2007
Springer
95views Hardware» more  SAT 2007»
15 years 8 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
DSN
2006
IEEE
15 years 8 months ago
Secure Split Assignment Trajectory Sampling: A Malicious Router Detection System
Routing infrastructure plays a vital role in the Internet, and attacks on routers can be damaging. Compromised routers can drop, modify, mis-forward or reorder valid packets. Exis...
Sihyung Lee, Tina Wong, Hyong S. Kim