Search

Your search keyword '"Vojnar, Tomas"' showing total 191 results

Search Constraints

Start Over You searched for: Author "Vojnar, Tomas" Remove constraint Author: "Vojnar, Tomas" Database Springer Nature eBooks Remove constraint Database: Springer Nature eBooks
191 results on '"Vojnar, Tomas"'

Search Results

1. Deciding Boolean Separation Logic via Small Models

2. Template-Based Verification of Array-Manipulating Programs

3. Fast Matching of Regular Patterns with Synchronizing Counting

4. 2LS: Arrays and Loop Unwinding : (Competition Contribution)

5. GPU-Accelerated Synthesis of Probabilistic Programs

6. Static Deadlock Detection in Low-Level C Code

7. Integrating OSLC Services into Eclipse

8. Applying Custom Patterns in Semantic Equality Analysis

9. Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits

10. Symbiotic 7: Integration of Predator and More : (Competition Contribution)

11. PredatorHP Revamped (Not Only) for Interval-Sized Memory Regions and Memory Reallocation (Competition Contribution)

12. 2LS: Heap Analysis and Memory Safety : (Competition Contribution)

13. Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error

14. Succinct Determinisation of Counting Automata via Sphere Construction

15. J-ReCoVer: Java Reducer Commutativity Verifier

16. Automata Terms in a Lazy WSkS Decision Procedure

17. SL-COMP: Competition of Solvers for Separation Logic

18. ADAC: Automated Design of Approximate Circuits

19. 2LS: Memory Safety and Non-termination : (Competition Contribution)

20. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection

21. Discovering Concurrency Errors

22. Prediction of Coverage of Expensive Concurrency Metrics Using Cheaper Metrics

23. From Shapes to Amortized Complexity

24. Simulation Algorithms for Symbolic Automata

25. Forester: From Heap Shapes to Automata Predicates : (Competition Contribution)

26. Lazy Automata Techniques for WS1S

27. Effect Summaries for Thread-Modular Analysis : Sound Analysis Despite an Unsound Heuristic

28. SPEN: A Solver for Separation Logic

29. Counterexample Validation and Interpolation-Based Refinement for Forest Automata

30. Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems

31. Optimized PredatorHP and the SV-COMP Heap and Memory Safety Benchmark : (Competition Contribution)

32. Run Forester, Run Backwards! : (Competition Contribution)

33. From Low-Level Pointers to High-Level Containers

34. Predator Shape Analysis Tool Suite

35. Noise Injection Heuristics for Concurrency Testing

36. Predator Hunting Party (Competition Contribution)

37. Forester: Shape Analysis Using Tree Automata : (Competition Contribution)

38. Nested Antichains for WS1S

39. Microprocessor Hazard Analysis Via Formal Verification of Parameterized Systems

40. Dynamic Validation of Contracts in Concurrent Code

41. On Monitoring C/C++ Transactional Memory Programs

42. Compositional Entailment Checking for a Fragment of Separation Logic

43. Deciding Entailments in Inductive Separation Logic with Tree Automata

44. Multi-objective Genetic Optimization for Noise-Based Testing of Concurrent Software

45. An Abstraction of Multi-port Memories with Arbitrary Addressable Units

46. Fully Automated Shape Analysis Based on Forest Automata

47. Byte-Precise Verification of Low-Level List Manipulation

48. ANaConDA: A Framework for Analysing Multi-threaded C/C++ Programs on the Binary Level

50. Testing of Concurrent Programs Using Genetic Algorithms

Catalog

Books, media, physical & digital resources