265 results on '"Germán Vidal"'
Search Results
2. An Asynchronous Scheme for Rollback Recovery in Message-Passing Concurrent Programming Languages.
3. Reversible Debugging in Logic Programming.
4. Towards a Taxonomy for Reversible Computation Approaches.
5. From Reversible Computation to Checkpoint-Based Rollback Recovery for Message-Passing Concurrent Programs.
6. Reversible Debugging of Erlang Programs in CauDEr.
7. A Distribution Semantics for Probabilistic Term Rewriting.
8. Causal-Consistent Reversible Debugging: Improving CauDEr.
9. Explanations as Programs in Probabilistic Logic Programming.
10. Computing Race Variants in Message-Passing Concurrent Programming with Selective Receives.
11. Prefix-Based Tracing in Message-Passing Concurrency.
12. Causal-Consistent Reversible Debugging: Improving CauDEr.
13. An SMT-Based Concolic Testing Tool for Logic Programs.
14. Reversible Computations in Logic Programming.
15. Foundations of Reversible Computation.
16. A Case Study for Reversible Computing: Reversible Debugging of Concurrent Programs.
17. Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs.
18. Causal-Consistent Replay Debugging for Message Passing Programs.
19. Characterizing Compatible View Updates in Syntactic Bidirectionalization.
20. Selective Unification in (Constraint) Logic Programming.
21. Concolic Testing in CLP.
22. CauDEr: A Causal-Consistent Reversible Debugger for Erlang.
23. Specialization of Distributed Actors by Partial Evaluation.
24. A Program Instrumentation for Prefix-Based Tracing in Message-Passing Concurrency.
25. A Lightweight Approach to Computing Message Races with an Application to Causal-Consistent Reversible Debugging.
26. Introduction to the 35th International Conference on Logic Programming Special Issue.
27. Selective unification in constraint logic programming.
28. Reversible computation in term rewriting.
29. A theory of reversibility for Erlang.
30. Introduction to the special issue on computational logic for verification.
31. Reversible Debugging in Logic Programming.
32. Reversible Term Rewriting.
33. A Reversible Semantics for Erlang.
34. On the Completeness of Selective Unification in Concolic Testing of Logic Programs.
35. Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs.
36. Relative Termination via Dependency Pairs.
37. Towards Modelling Actor-Based Concurrency in Term Rewriting.
38. Reducing Relative Termination to Dependency Pair Problems.
39. Concolic Execution in Functional Programming by Program Instrumentation.
40. Concolic Execution and Test Case Generation in Prolog.
41. Towards Symbolic Execution in Erlang.
42. Towards Erlang Verification by Term Rewriting.
43. A Finite Representation of the Narrowing Space.
44. Computing More Specific Versions of Conditional Rewriting Systems.
45. Closed Symbolic Execution for Verifying Program Termination.
46. Program Inversion for Tail Recursive Functions.
47. A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs.
48. A framework for computing finite SLD trees.
49. Concolic testing in logic programming.
50. Symbolic execution as a basis for termination analysis.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.