TACAS 2010 - PDF Preprint Papers

TACAS 2010 Int. Workshop/Conference on Tools and Algorithms for the Construction and Analysis of Systems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TACAS-2010 Paper

click to vote

TACAS
2010
Springer

177views Algorithms» more TACAS 2010»

SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata

2 years 10 days ago

Download www.auresoft.com

We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...

Janusz Malinowski, Peter Niebert

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	177	SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata	claim
2	146	The OpenSMT Solver	claim
3	144	Stranger: An Automata-Based String Analysis Tool for PHP	claim
4	131	JTorX: A Tool for On-Line Model-Driven Test Derivation and Execution	claim
5	121	Approximating the Pareto Front of Multi-criteria Optimization Problems	claim
6	118	Trace-Based Symbolic Analysis for Atomicity Violations	claim
7	111	Blocked Clause Elimination	claim
8	102	Automated Termination Analysis for Programs with Second-Order Recursion	claim
9	98	When Simulation Meets Antichains	claim
10	93	Tracking Heaps That Hop with Heap-Hop	claim
11	93	On Weak Modal Compatibility, Refinement, and the MIO Workbench	claim
12	91	Simplifying Linearizability Proofs with Reduction and Abstraction	claim
13	91	Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions	claim
14	89	Boom: Taking Boolean Program Model Checking One Step Further	claim
15	88	Antichain Algorithms for Finite Automata	claim
16	87	Ranking Function Synthesis for Bit-Vector Relations	claim
17	87	An Alternative to SAT-Based Approaches for Bit-Vectors	claim
18	86	Optimal Tableau Algorithms for Coalgebraic Logics	claim
19	86	Automatic Analysis of Scratch-Pad Memory Code for Heterogeneous Multicore Processors	claim
20	86	Computing the Leakage of Information-Hiding Systems	claim
21	85	Statistical Measurement of Information Leakage	claim
22	78	Rational Synthesis	claim
23	75	Satisfiability Modulo the Theory of Costs: Foundations and Applications	claim
24	73	Preemption Sealing for Efficient Concurrency Testing	claim
25	69	Assume-Guarantee Verification for Probabilistic Systems	claim
26	68	SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems	claim
27	68	Efficient Detection of Errors in Java Components Using Random Environment and Restarts	claim
28	63	A Polymorphic Intermediate Verification Language: Design and Logical Encoding	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers