scientific article; zbMATH DE number 1834576

From MaRDI portal
Publication:4779119

zbMath1005.68099MaRDI QIDQ4779119

Roberto Giacobazzi, Elisa Quintarelli

Publication date: 24 November 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Code obfuscation against abstraction refinement attacks, Lattice-based refinement in bounded model checking, Inverse-limit and topological aspects of abstract interpretation, Complete Abstractions and Subclassical Modal Logics, Transforming Abstract Interpretations by Abstract Interpretation, Semantics-based software watermarking by abstract interpretation, Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation, Generalizing the Paige-Tarjan algorithm by abstract interpretation, Calculational design of a regular model checker by abstract interpretation, Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation, Maximal incompleteness as obfuscation potency, 3-valued abstraction: More precision at less cost, Correctness kernels of abstract interpretations, Incompleteness of states w.r.t. traces in model checking, Deriving Bisimulations by Simplifying Partitions, Internal and External Logics of Abstract Interpretations, Abstract Interpretation From a Denotational-semantics Perspective, Completeness of string analysis for dynamic languages, Observational Completeness on Abstract Interpretation, Refinement of Trace Abstraction, Abstract Interpretation from a Topological Perspective, An efficient simulation algorithm based on abstract interpretation, A semantic framework for the abstract model checking of tccp programs, What You Lose is What You Leak: Information Leakage in Declassification Policies, Extracting Program Logics From Abstract Interpretations Defined by Logical Relations