scientific article; zbMATH DE number 2161330
From MaRDI portal
Publication:4671219
zbMath1069.68534MaRDI QIDQ4671219
Flemming Nielson, Hanne Riis Nielson, Chris Hankin
Publication date: 26 April 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01)
Related Items
May-Happen-in-Parallel Analysis for Actor-Based Concurrency, Higher-Ranked Annotation Polymorphic Dependency Analysis, Transformations for Compositional Verification of Assumption-Commitment Properties, Combining Model Checking and Deduction, What is a free name in a process algebra?, From Jinja bytecode to term rewriting: a complexity reflecting transformation, Verifying pointer safety for programs with unknown calls, Static checking of GDPR-related privacy compliance for object-oriented distributed systems, Full characterization of a class of graphs tailored for software watermarking, Evaluation of the Implementation of an Abstract Interpretation Algorithm using Tabled CLP, Deciding program properties via complete abstractions on bounded domains, A sharing-based approach to supporting adaptation in service compositions, Model checking existential logic on partially ordered sets, A certified lightweight non-interference Java bytecode verifier, A monotone framework for CCS, Backwards type analysis of asynchronous method calls, Unnamed Item, From flow logic to static type systems for coordination languages, Completeness and Herbrand theorems for nominal logic, Cost analysis of object-oriented bytecode programs, Heuristics for Safety and Security Constraints, Automated formal analysis and verification: an overview