On the public citation graph

Programming languages and systems : Second Asian Symposium, APLAS 2004, Taipei, Taiwan, November 4-6, 2004 : proceedings

https://doi.org/10.1007/b102225
0 signed · 1427 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4471-2297-5_1openalex-snapshot
The Many Faces of Complexity in Software Design
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_122openalex-snapshot
Mobile Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-17138-4_4openalex-snapshot
Achieving Safety Incrementally with Checked C
inferred← citeshttps://doi.org/10.1007/978-3-030-89159-6_21openalex-snapshot
GATE: Gradual Effect Types
inferred← citeshttps://doi.org/10.1007/978-3-319-00948-3_3openalex-snapshot
Exploring a Model-Oriented and Executable Syntax for UML Attributes
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_18openalex-snapshot
Integrating Policy Iterations in Abstract Interpreters
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_21openalex-snapshot
An Expressive Framework for Verifying Deadlock Freedom
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_23openalex-snapshot
Precise Cost Analysis via Local Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_25openalex-snapshot
Termination and Cost Analysis of Loops with Concurrent Interleavings
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_41openalex-snapshot
MoTraS: A Tool for Modal Transition Systems and Their Extensions
inferred← citeshttps://doi.org/10.1007/978-3-319-02654-1_10openalex-snapshot
A Pretty Good Formatting Pipeline
inferred← citeshttps://doi.org/10.1007/978-3-319-02654-1_13openalex-snapshot
Whiley: A Platform for Research in Software Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-02726-5_2openalex-snapshot
VTOS: Research on Methodology of “Light-Weight” Formal Design and Verification for Microkernel OS
inferred← citeshttps://doi.org/10.1007/978-3-319-03524-6_26openalex-snapshot
On the Expressiveness of Attribute Global Types: The Formalization of a Real Multiagent System Protocol
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_10openalex-snapshot
Dynamic Alias Protection with Aliasing Contracts
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_13openalex-snapshot
Secure Compilation of Object-Oriented Components to Protected Module Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_16openalex-snapshot
Paragon for Practical Programming with Information-Flow Control
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_18openalex-snapshot
Semantics of Probabilistic Programs: A Weak Limit Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_19openalex-snapshot
Ambivalent Types for Principal Type Inference with GADTs
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_2openalex-snapshot
Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes
inferred← citeshttps://doi.org/10.1007/978-3-319-03542-0_5openalex-snapshot
A Hoare Logic for SIMT Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_13openalex-snapshot
Extracting Proofs from Tabled Proof Search
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_15openalex-snapshot
Certifiably Sound Parallelizing Transformations
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_2openalex-snapshot
Mostly Sound Type System Improves a Foundational Program Verifier
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_8openalex-snapshot
Nonfree Datatypes in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-319-03680-9_27openalex-snapshot
Model Checking for Reasoning about Incomplete Information Games
inferred← citeshttps://doi.org/10.1007/978-3-319-04132-2_13openalex-snapshot
Typelets — A Rule-Based Evaluation Model for Dynamic, Statically Typed User Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-319-04132-2_3openalex-snapshot
The F# Computation Expression Zoo
inferred← citeshttps://doi.org/10.1007/978-3-319-04897-0_10openalex-snapshot
Architectures for Inlining Security Monitors in Web Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_11openalex-snapshot
Refinement Types for tla +
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_18openalex-snapshot
Warps and Atomics: Beyond Barrier Synchronization in the Verification of GPU Kernels
inferred← citeshttps://doi.org/10.1007/978-3-319-06200-6_28openalex-snapshot
Synthesizing Predicates from Abstract Domain Losses
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_10openalex-snapshot
Abstract Dynamic Frames
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_26openalex-snapshot
Revisiting Compatibility of Input-Output Modal Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_27openalex-snapshot
Co-induction Simply
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_38openalex-snapshot
Computing Quadratic Invariants with Min- and Max-Policy Iterations: A Practical Comparison
inferred← citeshttps://doi.org/10.1007/978-3-319-06410-9_39openalex-snapshot
Efficient Self-composition for Weakest Precondition Calculi
inferred← citeshttps://doi.org/10.1007/978-3-319-06569-4_29openalex-snapshot
Formal Security Verification of Transport Protocols for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_20openalex-snapshot
Automata Learning: A Categorical Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-06880-0_8openalex-snapshot
Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_1openalex-snapshot
PrologCheck – Property-Based Testing in Prolog
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_15openalex-snapshot
A New Formalization of Subtyping to Match Subclasses to Subtypes
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_3openalex-snapshot
Guided Type Debugging
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_6openalex-snapshot
The Design and Implementation of BER MetaOCaml
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_7openalex-snapshot
On Cross-Stage Persistence in Multi-Stage Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_1openalex-snapshot
Analysis of Executable Software Models
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_5openalex-snapshot
Verification of Concurrent Systems with VerCors
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_6openalex-snapshot
Combining Monitoring with Run-Time Assertion Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_7openalex-snapshot
Test Case Generation by Symbolic Execution: Basic Concepts, a CLP-Based Instance, and Actor-Based Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-07452-8_6openalex-snapshot
On the Synthesis of Secure Services Composition
inferred← citeshttps://doi.org/10.1007/978-3-319-07602-7_20openalex-snapshot
Layered Reduction for Modal Specification Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-07602-7_3openalex-snapshot
Super-Dense Computation in Verification of Hybrid CSP Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-07602-7_9openalex-snapshot
Towards a Failure Model of Software Components
inferred← citeshttps://doi.org/10.1007/978-3-319-08260-8_4openalex-snapshot
Formalizing RESTful Services and Web-OS Middleware
inferred← citeshttps://doi.org/10.1007/978-3-319-08260-8_7openalex-snapshot
Safe Session-Based Service Orchestration with Unreliable Communication
inferred← citeshttps://doi.org/10.1007/978-3-319-08260-8_9openalex-snapshot
On the Expressiveness of Parameterization in Process-Passing
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_15openalex-snapshot
Proving Termination and Memory Safety for Programs with Pointer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_4openalex-snapshot
Unified Classical Logic Completeness
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_15openalex-snapshot
Engineering a Static Verification Tool for GPU Kernels
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_32openalex-snapshot
Optimal Guard Synthesis for Memory Safety
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_33openalex-snapshot
Don’t Sit on the Fence
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_4openalex-snapshot
Shape Analysis via Second-Order Bi-Abduction
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_5openalex-snapshot
ICE: A Robust Framework for Learning Invariants
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_57openalex-snapshot
QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_13openalex-snapshot
An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_19openalex-snapshot
Amortised Resource Analysis and Typed Polynomial Interpretations
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_16openalex-snapshot
Hypermap Specification and Certified Linked Implementation Using Orbits
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_17openalex-snapshot
A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_7openalex-snapshot
Truly Modular (Co)datatypes for Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-319-09099-3_12openalex-snapshot
A Case Study on Verification of a Cloud Hypervisor by Proof and Structural Testing
inferred← citeshttps://doi.org/10.1007/978-3-319-09099-3_16openalex-snapshot
How Test Generation Helps Software Specification and Deductive Verification in Frama-C
inferred← citeshttps://doi.org/10.1007/978-3-319-09108-2_10openalex-snapshot
Transformation and Refinement of Rigid Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-09108-2_5openalex-snapshot
Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-09156-3_1openalex-snapshot
Proof-Carrying Model for Parsing Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-09195-2_5openalex-snapshot
Interpretation of Linguistic Architecture
inferred← citeshttps://doi.org/10.1007/978-3-319-09967-5_1openalex-snapshot
Hierarchical Computation in the SPMD Programming Model
inferred← citeshttps://doi.org/10.1007/978-3-319-10082-1_3openalex-snapshot
Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_1openalex-snapshot
Shape and Content
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_13openalex-snapshot
Automated Theorem Prover Assisted Program Calculations
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_18openalex-snapshot
Towards a Formal Semantics-Based Technique for Interprocedural Slicing
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_2openalex-snapshot
How to Break the Bank: Semantics of Capability Policies
inferred← citeshttps://doi.org/10.1007/978-3-319-10181-1_21openalex-snapshot
Verifying Linearizability on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-10398-3_7openalex-snapshot
Attractor Equivalence: An Observational Semantics for Reaction Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-10431-7_20openalex-snapshot
IKOS: A Framework for Static Analysis Based on Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-319-10431-7_3openalex-snapshot
Completeness of Separation Logic with Inductive Definitions for Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-10696-0_23openalex-snapshot
On the Discriminating Power of Testing Equivalences for Reactive Probabilistic Systems: Results and Open Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-10696-0_5openalex-snapshot
A Statistical Approach for Computing Reachability of Non-linear and Stochastic Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10702-8_9openalex-snapshot
An Open Alternative for SMT-Based Verification of Scade Models
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_10openalex-snapshot
Reasoning Algebraically About Refinement on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_17openalex-snapshot
Modular Reasoning for Message-Passing Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_21openalex-snapshot
A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_14openalex-snapshot
Reactivity of Cooperative Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_15openalex-snapshot
Synthesis of Memory Fences via Refinement Propagation
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_18openalex-snapshot
An Abstract Domain Combinator for Separately Conjoining Memory Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_2openalex-snapshot
Peak Cost Analysis of Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_20openalex-snapshot
Region-Based Selective Flow-Sensitive Pointer Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_3openalex-snapshot
Backward Analysis via over-Approximate Abstraction and under-Approximate Subtraction
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_4openalex-snapshot
SawjaCard: A Static Analysis Tool for Certifying Java Card Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_5openalex-snapshot
Cyclic Abduction of Inductively Defined Safety and Termination Preconditions
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_6openalex-snapshot
Expectation Invariants for Probabilistic Program Loops as Fixed Points
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_7openalex-snapshot
An Abstract Domain to Infer Octagonal Constraints with Absolute Value
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_8openalex-snapshot
Verifying Recursive Programs Using Intraprocedural Analyzers
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_9openalex-snapshot
Automatic Analysis of Open Objects in Dynamic Language Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-11379-1_17openalex-snapshot
Formal Analysis of Security Procedures in LTE - A Feasibility Study
inferred← citeshttps://doi.org/10.1007/978-3-319-11599-3_3openalex-snapshot
DEICS: Data Erasure in Concurrent Software
inferred← citeshttps://doi.org/10.1007/978-3-319-11737-9_18openalex-snapshot
A Resource-Based Logic for Termination and Non-termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-11737-9_26openalex-snapshot
Contract-Based Verification of MATLAB and Simulink Matrix-Manipulating Code
inferred← citeshttps://doi.org/10.1007/978-3-319-12154-3_10openalex-snapshot
Separation Algebras for C Verification in Coq
inferred← citeshttps://doi.org/10.1007/978-3-319-12154-3_11openalex-snapshot
Automatically Verified Implementation of Data Structures Based on AVL Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-12154-3_3openalex-snapshot
Formalizing Semantics with an Automatic Program Verifier
inferred← citeshttps://doi.org/10.1007/978-3-319-12154-3_4openalex-snapshot
The KeY Platform for Verification and Analysis of Java Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-12466-7_4openalex-snapshot
Probabilistic Analysis of Programs: A Weak Limit Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-12466-7_6openalex-snapshot
A Hoare Logic for Energy Consumption Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-12466-7_7openalex-snapshot
Reasoning About Resources in the Embedded Systems Language Hume
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_14openalex-snapshot
Resource Protection Using Atomics
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_16openalex-snapshot
Simple and Efficient Algorithms for Octagons
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_19openalex-snapshot
A ZDD-Based Efficient Higher-Order Model Checking Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_20openalex-snapshot
Inferring Grammatical Summaries of String Values
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_23openalex-snapshot
Call-by-Value in a Basic Logic for Interaction
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_4openalex-snapshot
Automatic Memory Management Based on Program Transformation Using Ownership
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_5openalex-snapshot
The Essence of Ruby
inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_2openalex-snapshot
Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
inferred← citeshttps://doi.org/10.1007/978-3-319-12904-4_7openalex-snapshot
Modelling and Verifying Contract-Oriented Systems in Maude
inferred← citeshttps://doi.org/10.1007/978-3-319-12982-2_13openalex-snapshot
A Rule-Based Model of Base Excision Repair
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_1openalex-snapshot
Using Coarse-Grained Abstractions to Verify Linearizability on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_11openalex-snapshot
Handling TSO in Mechanized Linearizability Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-13338-6_15openalex-snapshot
Reduction of Resolution Refutations and Interpolants via Subsumption
inferred← citeshttps://doi.org/10.1007/978-3-319-14125-1_13openalex-snapshot
Generating Specialized Interpreters for Modular Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-14130-5_17openalex-snapshot
Flexible and Efficient Reuse of Multi-mode Components for Building Multi-mode Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-14484-9_13openalex-snapshot
Efficient Verification of MASs with Projections
inferred← citeshttps://doi.org/10.1007/978-3-319-14675-1_2openalex-snapshot
Resource-Dependent Algebraic Effects
inferred← citeshttps://doi.org/10.1007/978-3-319-14720-8_14openalex-snapshot
Verification Tools for Transactional Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-14806-9_7openalex-snapshot
A Formal Model for a Hybrid Programming Language
inferred← citeshttps://doi.org/10.1007/978-3-319-14896-0_3openalex-snapshot
Automating Software Analysis at Large Scale
inferred← citeshttps://doi.org/10.1007/978-3-319-15075-8_6openalex-snapshot
A Coinductive Animation of Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_15openalex-snapshot
Adding Formal Meanings to AADL with Hybrid Annex
inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_17openalex-snapshot
Intransitive Non-Interference by Unfolding
inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_22openalex-snapshot
Admit Your Weakness: Verifying Correctness on TSO Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_2openalex-snapshot
Ode to the PST
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_20openalex-snapshot
From EU Projects to a Family of Model Checkers
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_29openalex-snapshot
The Evolution of Jolie
inferred← citeshttps://doi.org/10.1007/978-3-319-15545-6_32openalex-snapshot
A White Box Perspective on Behavioural Adaptation
inferred← citeshttps://doi.org/10.1007/978-3-319-15618-7_4openalex-snapshot
Idea: State-Continuous Transfer of State in Protected-Module Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-15618-7_9openalex-snapshot
Idea: Towards an Inverted Cloud
inferred← citeshttps://doi.org/10.1007/978-3-319-16310-9_5openalex-snapshot
From Local to Global Knowledge and Back
inferred← citeshttps://doi.org/10.1007/978-3-319-17112-8_4openalex-snapshot
A Formal Model of Client-Cloud Interaction
inferred← citeshttps://doi.org/10.1007/978-3-319-17524-9_11openalex-snapshot
First-Order Transitive Closure Axiomatization via Iterative Invariant Injections
inferred← citeshttps://doi.org/10.1007/978-3-319-17822-6_8openalex-snapshot
Partial Evaluation for Java Malware Detection
inferred← citeshttps://doi.org/10.1007/978-3-319-18941-3_4openalex-snapshot
A Gentle Introduction to Multiparty Asynchronous Session Types
inferred← citeshttps://doi.org/10.1007/978-3-319-19249-9_12openalex-snapshot
A Framework for Correctness Criteria on Weak Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-319-19282-6_9openalex-snapshot
A Labelled Semantics for Soft Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_34openalex-snapshot
Automated Theorem Proving for Assertions in Separation Logic with All Connectives
inferred← citeshttps://doi.org/10.1007/978-3-319-22969-0_16openalex-snapshot
Formalizing a Secure Foreign Function Interface
inferred← citeshttps://doi.org/10.1007/978-3-319-26529-2_11openalex-snapshot
Shifting the Blame
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_21openalex-snapshot
The Recursive Union of Some Gradual Types
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_22openalex-snapshot
A Delta for Hybrid Type Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_1openalex-snapshot
Consistent Subtyping for All
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_27openalex-snapshot
Session-Typed Concurrent Contracts
inferred← citeshttps://doi.org/10.1007/978-3-540-68234-9_48openalex-snapshot
WSMO Choreography: From Abstract State Machines to Concurrent Transaction Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_21openalex-snapshot
A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_24openalex-snapshot
Precise Interval Analysis vs. Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_8openalex-snapshot
Verifying Dynamic Pointer-Manipulating Threads
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_9openalex-snapshot
Proofs and Refutations for Probabilistic Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-68265-3_13openalex-snapshot
A Formal Account of WS-BPEL
inferred← citeshttps://doi.org/10.1007/978-3-540-68265-3_14openalex-snapshot
How to Infer Finite Session Types in a Calculus of Services and Sessions
inferred← citeshttps://doi.org/10.1007/978-3-540-68265-3_16openalex-snapshot
Formal Analysis of BPMN Via a Translation into COWS
inferred← citeshttps://doi.org/10.1007/978-3-540-68265-3_2openalex-snapshot
Implementing Session Centered Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-68265-3_5openalex-snapshot
Multiparty Sessions in SOC
inferred← citeshttps://doi.org/10.1007/978-3-540-68265-3_8openalex-snapshot
Session Types for Orchestration Charts
inferred← citeshttps://doi.org/10.1007/978-3-540-68413-8_8openalex-snapshot
Rule-Based Modelling, Symmetries, Refinements
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_10openalex-snapshot
Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section
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-68679-8_19openalex-snapshot
Business Process Modeling for Organizational Knowledge Management
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_20openalex-snapshot
Event-Based Service Coordination
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_22openalex-snapshot
The Temporal Logic of Rewriting: A Gentle Introduction
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_23openalex-snapshot
A Heterogeneous Approach to UML Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_34openalex-snapshot
A Category of Explicit Fusions
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_35openalex-snapshot
What Do Semantics Matter When the Meat Is Overcooked?
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_40openalex-snapshot
A Type System for Client Progress in a Service-Oriented Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_41openalex-snapshot
Session and Union Types for Object Oriented Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_43openalex-snapshot
Specifying and Analysing SOC Applications with COWS
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_8openalex-snapshot
Explicit State Model Checking for Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_9openalex-snapshot
Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_9openalex-snapshot
Checking Correctness of Transactional Behaviors
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_13openalex-snapshot
CoBoxes: Unifying Active Objects and Structured Heaps
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_2openalex-snapshot
Termination Analysis of Java Bytecode
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_3openalex-snapshot
Sessions and Pipelines for Structured Service Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_4openalex-snapshot
Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_5openalex-snapshot
Behavioural Theory at Work: Program Transformations in a Service-Centred Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_8openalex-snapshot
Modeling and Model Checking Software Product Lines
inferred← citeshttps://doi.org/10.1007/978-3-540-68894-5_8openalex-snapshot
Process Algebras in Systems Biology
inferred← citeshttps://doi.org/10.1007/978-3-540-68942-3_8openalex-snapshot
Using Programming Language Theory to Make Automatic Differentiation Sound and Efficient
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_1openalex-snapshot
Transforming Abstract Interpretations by Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_16openalex-snapshot
SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_2openalex-snapshot
Reflections on the Role of Static Analysis in Cooperative Bug Isolation
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_20openalex-snapshot
Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_21openalex-snapshot
Splitting the Control Flow with Boolean Flags
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_3openalex-snapshot
Relational Analysis of Correlation
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_7openalex-snapshot
Solving Multiple Dataflow Queries Using WPDSs
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_8openalex-snapshot
Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA
showing the first 200 of 1427 · page through all 1427
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.