On the public citation graph

Verification : theory and practice : essays dedicated to Zohar Manna on the occasion of his 64th birthday

https://doi.org/10.1007/b12001

0 signed · 176 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-540-39910-0_11openalex-snapshot

Verification by Abstract Interpretation

inferredcites →https://doi.org/10.1007/978-3-540-39910-0_13openalex-snapshot

A Compositional Operational Semantics for Java MT

inferredcites →https://doi.org/10.1007/978-3-540-39910-0_15openalex-snapshot

Efficient Boundary Values Generation in General Metric Spaces for Software Component Testing

inferredcites →https://doi.org/10.1007/978-3-540-39910-0_19openalex-snapshot

Qualitative Theorem Proving in Linear Constraints

inferredcites →https://doi.org/10.1007/978-3-540-39910-0_20openalex-snapshot

Some Institutional Requirements for Temporal Reasoning on Dynamic Reconfiguration of Component Based Systems

inferredcites →https://doi.org/10.1007/978-3-540-39910-0_24openalex-snapshot

Unit Checking: Symbolic Model Checking for a Unit of Code

inferredcites →https://doi.org/10.1007/978-3-540-39910-0_32openalex-snapshot

Program Synthesis for Multi-agent Question Answering

inferredcites →https://doi.org/10.1007/978-3-540-39910-0_5openalex-snapshot

Domain Engineering: a “Radical Innovation” for Software and Systems Engineering?

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118720103.ch6openalex-snapshot

TIME‐EFFICIENT STATE‐SPACE ANALYSIS IN SOFTWARE MODEL CHECKING

inferred← citeshttps://doi.org/10.1007/0-387-27972-5_12openalex-snapshot

WIZER: Automated Model Improvement in Multi-Agent Social-Network Systems

inferred← citeshttps://doi.org/10.1007/11417019_15openalex-snapshot

Synchronized Hyperedge Replacement for Heterogeneous Systems

inferred← citeshttps://doi.org/10.1007/11417019_3openalex-snapshot

A Process Calculus for QoS-Aware Applications

inferred← citeshttps://doi.org/10.1007/11430230_8openalex-snapshot

Multiplexing of Partially Ordered Events

inferred← citeshttps://doi.org/10.1007/11494744_12openalex-snapshot

Derivation of Non-structural Invariants of Petri Nets Using Abstract Interpretation

inferred← citeshttps://doi.org/10.1007/11523468_108openalex-snapshot

About Hoare Logics for Higher-Order Store

inferred← citeshttps://doi.org/10.1007/11537328_4openalex-snapshot

The BLAST Software Verification System

inferred← citeshttps://doi.org/10.1007/11559306_15openalex-snapshot

The ASM Method for System Design and Analysis. A Tutorial Introduction

inferred← citeshttps://doi.org/10.1007/11559306_3openalex-snapshot

Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic

inferred← citeshttps://doi.org/10.1007/11560586_31openalex-snapshot

A Typed Semantics of Higher-Order Store and Subtyping

inferred← citeshttps://doi.org/10.1007/11562948_26openalex-snapshot

Synthesis of Interface Automata

inferred← citeshttps://doi.org/10.1007/11691372_17openalex-snapshot

Finitary Winning in ω-Regular Games

inferred← citeshttps://doi.org/10.1007/11804192_2openalex-snapshot

Synchronised Hyperedge Replacement as a Model for Service Oriented Computing

inferred← citeshttps://doi.org/10.1007/11829263_7openalex-snapshot

A Computerized Referee

inferred← citeshttps://doi.org/10.1007/11874683_38openalex-snapshot

Separation Logic for Higher-Order Store

inferred← citeshttps://doi.org/10.1007/11916246_12openalex-snapshot

Rigorous Fault Tolerance Using Aspects and Formal Methods

inferred← citeshttps://doi.org/10.1007/11940197_16openalex-snapshot

Online Testing with Reinforcement Learning

inferred← citeshttps://doi.org/10.1007/978-0-85729-808-9_3openalex-snapshot

A Survey of Inference Mechanisms

inferred← citeshttps://doi.org/10.1007/978-3-030-49636-4_8openalex-snapshot

Design Signoff

inferred← citeshttps://doi.org/10.1007/978-3-211-09442-6_2openalex-snapshot

Modeling Criminal Activity in Urban Landscapes

inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_3openalex-snapshot

Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey

inferred← citeshttps://doi.org/10.1007/978-3-319-16310-9_13openalex-snapshot

Tools for Ensemble Design and Runtime

inferred← citeshttps://doi.org/10.1007/978-3-319-16310-9_4openalex-snapshot

Reconciling White-Box and Black-Box Perspectives on Behavioral Self-adaptation

inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_6openalex-snapshot

Deciding Local Theory Extensions via E-matching

inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_22openalex-snapshot

Fine-Grained Caching of Verification Results

inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9openalex-snapshot

Computing and Software Science

inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_7openalex-snapshot

SAT Based Predicate Abstraction for Hardware Verification

inferred← citeshttps://doi.org/10.1007/978-3-540-27864-1_2openalex-snapshot

The Blast Query Language for Software Verification

inferred← citeshttps://doi.org/10.1007/978-3-540-27864-1_7openalex-snapshot

Constraint-Based Linear-Relations Analysis

inferred← citeshttps://doi.org/10.1007/978-3-540-30187-5_24openalex-snapshot

Deductive Verification of UML Models in TLPVS

inferred← citeshttps://doi.org/10.1007/978-3-540-30472-2_5openalex-snapshot

A Practice-Oriented Course on the Principles of Computation, Programming, and System Design and Analysis

inferred← citeshttps://doi.org/10.1007/978-3-540-31984-9_2openalex-snapshot

Checking Memory Safety with Blast

inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_19openalex-snapshot

Denotational Semantics for Abadi and Leino’s Logic of Objects

inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_23openalex-snapshot

Asserting Bytecode Safety

inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_23openalex-snapshot

Intruder Deduction for AC-Like Equational Theories with Homomorphisms

inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_4openalex-snapshot

Combining Lists with Non-stably Infinite Theories

inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_5openalex-snapshot

Towards Posit & Prove Calculi for Requirements Engineering and Software Design

inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_1openalex-snapshot

Aspects and Formal Methods

inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_11openalex-snapshot

Semiring-Based Soft Constraints

inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_21openalex-snapshot

Protocol Modeling with Model Program Composition

inferred← citeshttps://doi.org/10.1007/978-3-540-69052-8_21openalex-snapshot

Ranking Links on the Web: Search and Surf Engines

inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_18openalex-snapshot

Automated Test Generation and Verified Software

inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_35openalex-snapshot

Linking the Meaning of Programs to What the Compiler Can Verify

inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_37openalex-snapshot

Model-Checking Software Using Precise Abstractions

inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_13openalex-snapshot

Mechanical Verification of Transactional Memories with Non-transactional Memory Accesses

inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_14openalex-snapshot

Blasting Linux Code

inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_34openalex-snapshot

Challenges in the Automated Verification of Security Protocols

inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_24openalex-snapshot

MAVEN: Modular Aspect Verification

inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_47openalex-snapshot

Combined Satisfiability Modulo Parametric Theories

inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_8openalex-snapshot

Improving Static Variable Orders Via Invariants

inferred← citeshttps://doi.org/10.1007/978-3-540-73196-2_9openalex-snapshot

Composition of Model Programs

inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_4openalex-snapshot

Minimal Counterexample Generation for SPIN

inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_4openalex-snapshot

Intruders with Caps

inferred← citeshttps://doi.org/10.1007/978-3-540-75336-0_13openalex-snapshot

A Fuzzy Approach for Negotiating Quality of Services

inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_2openalex-snapshot

On the Notion of Vacuous Truth

inferred← citeshttps://doi.org/10.1007/978-3-540-77505-8_23openalex-snapshot

Combination of Abstractions in the ASTRÉE Static Analyzer

inferred← citeshttps://doi.org/10.1007/978-3-540-77535-5_5openalex-snapshot

Information Hiding in Software with Mixed Boolean-Arithmetic Transforms

inferred← citeshttps://doi.org/10.1007/978-3-540-77966-7_12openalex-snapshot

Test Case Generation for Ultimately Periodic Paths

inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_21openalex-snapshot

All You Need Is Compassion

inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_9openalex-snapshot

Diagnostic Information for Realizability

inferred← citeshttps://doi.org/10.1007/978-3-540-78917-8_2openalex-snapshot

Model-Based Testing of Object-Oriented Reactive Systems with Spec Explorer

inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_23openalex-snapshot

Evolving Specification Engineering

inferred← citeshttps://doi.org/10.1007/978-3-642-00867-2_3openalex-snapshot

Temporal Verification of Fault-Tolerant Protocols

inferred← citeshttps://doi.org/10.1007/978-3-642-01748-3_9openalex-snapshot

Modular Verification of Strongly Invasive Aspects

inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_5openalex-snapshot

Locality Results for Certain Extensions of Theories with Bridging Functions

inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_21openalex-snapshot

Input-Output Model Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_14openalex-snapshot

Balanced Paths in Colored Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_9openalex-snapshot

UnitCheck: Unit Testing and Model Checking Combined

inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_1openalex-snapshot

A Bibliography of Willem-Paul de Roever

inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_7openalex-snapshot

Explicit Fair Scheduling for Dynamic Control

inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_14openalex-snapshot

Fluid Updates: Beyond Strong vs. Weak Updates

inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_4openalex-snapshot

The Localization Reduction and Counterexample-Guided Abstraction Refinement

inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_5openalex-snapshot

A Scalable Segmented Decision Tree Abstract Domain

inferred← citeshttps://doi.org/10.1007/978-3-642-14808-8_21openalex-snapshot

Towards Managing Dynamic Reconfiguration of Software Systems in a Categorical Setting

inferred← citeshttps://doi.org/10.1007/978-3-642-15643-4_4openalex-snapshot

Promptness in ω-Regular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_11openalex-snapshot

Automatic Abstraction for Intervals Using Boolean Formulae

inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_7openalex-snapshot

A Formal Approach to Analyzing Interference Problems in Aspect-Oriented Designs

inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_45openalex-snapshot

Alternating Interval Based Temporal Logics

inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_25openalex-snapshot

A Theory of Skiplists with Applications to the Verification of Concurrent Datatypes

inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_5openalex-snapshot

System Verification through Program Verification

inferred← citeshttps://doi.org/10.1007/978-3-642-24443-8_21openalex-snapshot

An Evolutionary Approach for Program Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_16openalex-snapshot

A Formal Engineering Approach to High-Level Design of Situation Analysis Decision Support Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-25032-3_3openalex-snapshot

Full Abstraction at Package Boundaries of Object-Oriented Languages

inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_10openalex-snapshot

A Lightweight Technique for Distributed and Incremental Program Verification

inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_25openalex-snapshot

Decision Procedures for Region Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-27951-5_39openalex-snapshot

Generating Inductive Invariants for Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-642-28279-9_6openalex-snapshot

The Subject-Oriented Approach to Software Design and the Abstract State Machines Method

inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_8openalex-snapshot

A Compositional Specification Theory for Component Behaviours

inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_7openalex-snapshot

Inferring Definite Counterexamples through Under-Approximation

inferred← citeshttps://doi.org/10.1007/978-3-642-30729-4_12openalex-snapshot

Mechanized Extraction of Topology Anti-patterns in Wireless Networks

inferred← citeshttps://doi.org/10.1007/978-3-642-31875-7_9openalex-snapshot

Asynchronous Learning for Service Composition

inferred← citeshttps://doi.org/10.1007/978-3-642-33296-8_16openalex-snapshot

Alternating-Time Temporal Logic in the Calculus of (Co)Inductive Constructions

inferred← citeshttps://doi.org/10.1007/978-3-642-34059-8_19openalex-snapshot

Evolution, Adaptation, and the Quest for Incrementality

inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_12openalex-snapshot

SMT-Based Array Invariant Generation

inferred← citeshttps://doi.org/10.1007/978-3-642-36334-4_14openalex-snapshot

On the Implementation of a Pairing-Based Cryptographic Protocol in a Constrained Device

inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_21openalex-snapshot

eVolCheck: Incremental Upgrade Checker for C

inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_26openalex-snapshot

Information Reuse for Multi-goal Reachability Analyses

inferred← citeshttps://doi.org/10.1007/978-3-642-37395-4_3openalex-snapshot

Towards Agile Verification

inferred← citeshttps://doi.org/10.1007/978-3-642-37635-1_6openalex-snapshot

Adaptable Transition Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_9openalex-snapshot

Input-Output Conformance Simulation (iocos) for Model Based Testing

inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_1openalex-snapshot

Reuse of Verification Results

inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_22openalex-snapshot

Error-Completion in Interface Theories

inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_54openalex-snapshot

Automating Separation Logic Using SMT

inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_65openalex-snapshot

Programs from Proofs – A PCC Alternative

inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_24openalex-snapshot

Constraint-Based Program Reasoning with Heaps and Separation

inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_4openalex-snapshot

Reachability Modulo Theories

inferred← citeshttps://doi.org/10.1007/978-3-658-09994-7_11openalex-snapshot

Behavior Driven Development for Tests and Verification

inferred← citeshttps://doi.org/10.1007/978-3-662-46081-8_2openalex-snapshot

Abstracting Induction by Extrapolation and Interpolation

inferred← citeshttps://doi.org/10.1007/s10817-006-9042-1openalex-snapshot

Deciding Boolean Algebra with Presburger Arithmetic

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.066openalex-snapshot

Combining Non-stably Infinite, Non-first Order Theories

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.054openalex-snapshot

Intruder Deduction for the Equational Theory of Exclusive-or with Commutative and Distributive Encryption

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.07.008openalex-snapshot

Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.08.031openalex-snapshot

Domain-specific Semantics and Data Refinement of Object Models

inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.097openalex-snapshot

Service Discovery and Negotiation With COWS

inferred← citeshttps://doi.org/10.1016/j.entcs.2011.07.003openalex-snapshot

On-The-Fly Path Reduction

inferred← citeshttps://doi.org/10.1016/j.future.2007.08.001openalex-snapshot

Distributed strategic interleaving with load balancing

inferred← citeshttps://doi.org/10.1016/j.ic.2006.10.008openalex-snapshot

Intruder deduction for the equational theory of Abelian groups with distributive encryption

inferred← citeshttps://doi.org/10.1016/j.ic.2013.08.011openalex-snapshot

Specification patterns for reasoning about recursion through the store

inferred← citeshttps://doi.org/10.1016/j.ic.2014.02.005openalex-snapshot

Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate

inferred← citeshttps://doi.org/10.1016/j.infsof.2021.106800openalex-snapshot

A systematic literature review on counterexample explanation

inferred← citeshttps://doi.org/10.1016/j.jal.2011.11.002openalex-snapshot

A calculus for orchestration of web services

inferred← citeshttps://doi.org/10.1016/j.jcss.2011.08.002openalex-snapshot

Verification of object-oriented programs: A transformational approach

inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.11.005openalex-snapshot

Nested-unit Petri nets

inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.004openalex-snapshot

Composing model programs for analysis

inferred← citeshttps://doi.org/10.1016/j.jmathb.2019.04.003openalex-snapshot

Localized considerations and patching: Accounting for persistent attributes of an algorithm on a contextualized graph theory task

inferred← citeshttps://doi.org/10.1016/j.jss.2009.05.016openalex-snapshot

Issues in using model checkers for test case generation

inferred← citeshttps://doi.org/10.1016/j.jss.2012.02.034openalex-snapshot

Coding-error based defects in enterprise resource planning software: Prevention, discovery, elimination and mitigation

inferred← citeshttps://doi.org/10.1016/j.jss.2017.03.010openalex-snapshot

A method to localize faults in concurrent C programs

inferred← citeshttps://doi.org/10.1016/j.scico.2009.04.004openalex-snapshot

Pentagons: A weakly relational abstract domain for the efficient validation of array accesses

inferred← citeshttps://doi.org/10.1016/j.scico.2013.10.002openalex-snapshot

A fully abstract trace-based semantics for reasoning about backward compatibility of class libraries

inferred← citeshttps://doi.org/10.1016/j.scico.2013.11.026openalex-snapshot

Syntactic-semantic incrementality for agile verification

inferred← citeshttps://doi.org/10.1016/j.scico.2018.08.004openalex-snapshot

Full-abstraction for client testing preorders

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.10.022openalex-snapshot

Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.029openalex-snapshot

Quantitatively fair scheduling

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.003openalex-snapshot

An observationally complete program logic for imperative higher-order functions

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.021openalex-snapshot

A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.020openalex-snapshot

Minimal counterexamples for linear-time probabilistic verification

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.019openalex-snapshot

Model checking open systems with alternating projection temporal logic

inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03012-xopenalex-snapshot

Chapter 12 Temporal Representation and Reasoning

inferred← citeshttps://doi.org/10.1017/s0956796808006953openalex-snapshot

Hoare type theory, polymorphism and separation

inferred← citeshttps://doi.org/10.1093/logcom/exu077openalex-snapshot

The abstract state machines method for modular design and analysis of programming languages

inferred← citeshttps://doi.org/10.1109/pesos.2012.6225935openalex-snapshot

Local model learning for asynchronous services

inferred← citeshttps://doi.org/10.1109/sefm.2010.36openalex-snapshot

Structured Counterexamples for the Temporal Description Logic ALCCTL

inferred← citeshttps://doi.org/10.1109/tpds.2013.180openalex-snapshot

New Algorithms for Secure Outsourcing of Modular Exponentiations

inferred← citeshttps://doi.org/10.1134/s1064562419020327openalex-snapshot

New Approach to Farkas’ Theorem of the Alternative

inferred← citeshttps://doi.org/10.1134/s2070046615030012openalex-snapshot

Quantization causes waves: Smooth finitely computable functions are affine

inferred← citeshttps://doi.org/10.1142/s0218194006002963openalex-snapshot

ACTION MACHINES: A FRAMEWORK FOR ENCODING AND COMPOSING PARTIAL BEHAVIORS

inferred← citeshttps://doi.org/10.1145/1159803.1159812openalex-snapshot

Polymorphism and separation in hoare type theory

inferred← citeshttps://doi.org/10.1145/1160074.1159812openalex-snapshot

Polymorphism and separation in hoare type theory

inferred← citeshttps://doi.org/10.1145/1363686.1363736openalex-snapshot

Pentagons

inferred← citeshttps://doi.org/10.1145/1378533.1378550openalex-snapshot

A transactional approach to lock scalability

inferred← citeshttps://doi.org/10.1145/1614431.1614432openalex-snapshot

Finitary winning in ω-regular games

inferred← citeshttps://doi.org/10.1145/1838552.1838557openalex-snapshot

Unicast and multicast QoS routing with soft-constraint logic programming

inferred← citeshttps://doi.org/10.1145/2591062.2591197openalex-snapshot

Incremental reachability checking of KernelC programs using matching logic

inferred← citeshttps://doi.org/10.1145/3147426openalex-snapshot

Model and Program Repair via SAT Solving

inferred← citeshttps://doi.org/10.1145/3278122.3278125openalex-snapshot

Verification of high-level transformations with inductive refinement types

inferred← citeshttps://doi.org/10.1145/3324884.3416554openalex-snapshot

Verified from scratch

inferred← citeshttps://doi.org/10.1145/3393934.3278125openalex-snapshot

Verification of high-level transformations with inductive refinement types

inferred← citeshttps://doi.org/10.1145/3626823openalex-snapshot

Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator

inferred← citeshttps://doi.org/10.1155/2014/930186openalex-snapshot

Testing Automation of Context-Oriented Programs Using Separation Logic

inferred← citeshttps://doi.org/10.13053/cys-21-3-2444openalex-snapshot

Branching Path Planning with Modal Logics

inferred← citeshttps://doi.org/10.26507/rei.v8n15.233openalex-snapshot

LA LÓGICA EN LAS CIENCIAS COMPUTACIONALES

inferred← citeshttps://doi.org/10.31144/si.2307-6410.2024.n24.p91-100openalex-snapshot

ПРОГРАММИРУЕМ ОПЕРАЦИОННУЮ СЕМАНТИКУ ЯЗЫКОВ ПРОГРАММИРОВАНИЯ

inferred← citeshttps://doi.org/10.3390/app15020680openalex-snapshot

A Polynomial-Time Algorithm for Detection of Uncovered Transitions in a Petri Net-Based Concurrent System

inferred← citeshttps://doi.org/10.4271/2008-01-0220openalex-snapshot

A Critical Analysis of Model-Based Formal Verification Efforts within the Automotive Industry

inferred← citeshttps://doi.org/10.5555/2394101.2394143openalex-snapshot

i2MAP: an incremental and iterative modeling and analysis process

inferred← citeshttps://doi.org/10.5555/2666048.2666052openalex-snapshot

Local model learning for asynchronous services

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.