| Nome |
# |
|
On constructivity of galois connections, file e14fb26a-740e-3de1-e053-1705fe0ac030
|
181
|
|
Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions, file e14fb267-b3d7-3de1-e053-1705fe0ac030
|
173
|
|
A²I: abstract² interpretation, file e14fb26b-232c-3de1-e053-1705fe0ac030
|
113
|
|
Abstracting Nash equilibria of supermodular games, file e14fb26e-7eff-3de1-e053-1705fe0ac030
|
74
|
|
Invertible Linear Transforms of Numerical Abstract Domains, file e14fb26b-0c87-3de1-e053-1705fe0ac030
|
72
|
|
Analyzing program analyses, file e14fb26e-84dd-3de1-e053-1705fe0ac030
|
57
|
|
Program analysis is harder than verification: A computability perspective, file e14fb26f-0bc3-3de1-e053-1705fe0ac030
|
47
|
|
A Logic for Locally Complete Abstract Interpretations, file e14fb26f-1aa0-3de1-e053-1705fe0ac030
|
33
|
|
A Rice’s Theorem for Abstract Semantics, file e14fb26f-1082-3de1-e053-1705fe0ac030
|
26
|
|
Abstract interpretation of decision tree ensemble classifiers, file e14fb26d-22bf-3de1-e053-1705fe0ac030
|
21
|
|
Inclusion Testing of Büchi Automata Based on Well-Quasiorders, file e14fb26e-c8e8-3de1-e053-1705fe0ac030
|
19
|
|
A new efficient simulation equivalence algorithm, file e14fb267-8b47-3de1-e053-1705fe0ac030
|
7
|
|
Abstract interpretation repair, file 0c0d0103-2520-48e3-926d-f5b40ee37d87
|
5
|
|
Intensional Kleene and Rice theorems for abstract program semantics, file 21d9d0b7-0275-4793-8f41-cd41fc8cb747
|
5
|
|
Local Completeness Logic on Kleene Algebra with Tests, file ad9f8ccb-b7c1-498e-a03e-ac1b30f31091
|
5
|
|
Saving space in a time efficient simulation algorithm, file e14fb267-83f0-3de1-e053-1705fe0ac030
|
5
|
|
Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation, file e14fb267-a33b-3de1-e053-1705fe0ac030
|
5
|
|
A more efficient simulation algorithm on Kripke structures, file e14fb267-a572-3de1-e053-1705fe0ac030
|
5
|
|
Decidability and Synthesis of Abstract Inductive Invariants, file e14fb26c-f6a9-3de1-e053-1705fe0ac030
|
5
|
|
Language Inclusion Algorithms as Complete Abstract Interpretations, file e14fb26e-6167-3de1-e053-1705fe0ac030
|
5
|
|
Robustness Verification of Support Vector Machines, file e14fb26e-6082-3de1-e053-1705fe0ac030
|
4
|
|
Abstract interpretation of supermodular games, file e14fb26e-6421-3de1-e053-1705fe0ac030
|
4
|
|
An abstract interpretation-based model of tracing just-in-time compilation, file e14fb26e-b3e9-3de1-e053-1705fe0ac030
|
4
|
|
Complete Abstractions for Checking Language Inclusion, file e14fb26e-e292-3de1-e053-1705fe0ac030
|
4
|
|
Genetic adversarial training of decision trees, file e14fb26f-21a8-3de1-e053-1705fe0ac030
|
4
|
|
History of Abstract Interpretation, file e14fb26f-42e8-3de1-e053-1705fe0ac030
|
4
|
|
Abstract Interpretation-Based Feature Importance for Support Vector Machines, file 36b4081e-ed75-4464-923b-5ee822b37980
|
2
|
|
Analyzing program analyses, file 5d3bbe91-21ab-4407-829c-92da3d096f20
|
2
|
|
Complementing logic program semantics, file e14fb267-6763-3de1-e053-1705fe0ac030
|
2
|
|
An abstract interpretation perspective on linear vs. branching time, file e14fb267-7093-3de1-e053-1705fe0ac030
|
2
|
|
Incompleteness of states w.r.t. traces in model checking, file e14fb267-70d6-3de1-e053-1705fe0ac030
|
2
|
|
Generalized strong preservation by abstract interpretation., file e14fb267-728c-3de1-e053-1705fe0ac030
|
2
|
|
Tracing compilation by abstract interpretation, file e14fb267-b0f9-3de1-e053-1705fe0ac030
|
2
|
|
Static Analysis: 24th International Symposium, SAS 2017 New York, NY, USA, august 30 - september 1, 2017 Proceedings, file e14fb269-f031-3de1-e053-1705fe0ac030
|
2
|
|
Generalized strong preservation by abstract interpretation., file 588b8f62-514f-4150-86d1-2076828c253f
|
1
|
|
Making abstract domains condensing, file 6e016554-684b-4cd0-ae8e-529ec33f6682
|
1
|
|
Local Completeness in Abstract Interpretation, file 7cdecd22-743f-44c3-be67-cbb3ddc173fc
|
1
|
|
A Correctness and Incorrectness Program Logic, file 89b8cd6f-341b-4c0d-9b1a-2f45ea0cadac
|
1
|
|
Probabilistic bisimulation and simulation algorithms by abstract interpretation, file e14fb267-6678-3de1-e053-1705fe0ac030
|
1
|
|
Compositional optimization of disjunctive abstract interpretations, file e14fb267-6762-3de1-e053-1705fe0ac030
|
1
|
|
States vs. traces in model checking by abstract interpretation, file e14fb267-6a10-3de1-e053-1705fe0ac030
|
1
|
|
Making abstract domains condensing, file e14fb267-7091-3de1-e053-1705fe0ac030
|
1
|
|
The Subgraph Similarity Problem, file e14fb267-7a90-3de1-e053-1705fe0ac030
|
1
|
|
Strong preservation of temporal fixpoint-based operators by abstract interpretation, file e14fb267-80ec-3de1-e053-1705fe0ac030
|
1
|
|
Static analysis, abstract interpretation and verification in (constraint logic) programming, file e14fb267-8412-3de1-e053-1705fe0ac030
|
1
|
|
Saving space in a time efficient simulation algorithm, file e14fb267-8814-3de1-e053-1705fe0ac030
|
1
|
|
A spectrum of behavioral relations over LTSs on probability distributions, file e14fb267-9be1-3de1-e053-1705fe0ac030
|
1
|
|
Complementation in abstract interpretation, file e14fb267-b3d5-3de1-e053-1705fe0ac030
|
1
|
|
Program analysis is harder than verification: A computability perspective, file e14fb26a-e20f-3de1-e053-1705fe0ac030
|
1
|
|
Fairness-Aware Training of Decision Trees by Abstract Interpretation, file e14fb26f-6b88-3de1-e053-1705fe0ac030
|
1
|
| Totale |
919 |