On the public citation graph
Refinement techniques in software engineering : First Pernambuco Summer School on Software Engineering, PSSE 2004, Recife, Brazil, November 23-December 5, 2004 : revised lectures
0 signed · 36 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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11603009openalex-snapshot
Formal Modeling and Analysis of Timed Systems
inferred← citeshttps://doi.org/10.1007/11768173_12openalex-snapshot
Pointers and Records in the Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-10882-7_23openalex-snapshot
UTP Designs for Binary Multirelations
inferred← citeshttps://doi.org/10.1007/978-3-319-14806-9_1openalex-snapshot
Three Approaches to Timed External Choice in UTP
inferred← citeshttps://doi.org/10.1007/978-3-319-14806-9_3openalex-snapshot
Angelicism in the Theory of Reactive Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-56991-8_26openalex-snapshot
Evolutionary Testing Using Particle Swarm Optimization in IOT Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_10openalex-snapshot
A Theory of Pointers for the UTP
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_5openalex-snapshot
Security, Probability and Nearly Fair Coins in the Cryptographers’ Café
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_12openalex-snapshot
The Miracle of Reactive Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_3openalex-snapshot
UTP and Temporal Logic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_4openalex-snapshot
A Note on Traces Refinement and the conf Relation in the Unifying Theories of Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_1openalex-snapshot
Specification Coverage for Testing in Circus
inferred← citeshttps://doi.org/10.1007/978-3-642-16690-7_9openalex-snapshot
Unifying Theories in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-18023-1_1openalex-snapshot
An Introduction to Software Product Line Refactoring
inferred← citeshttps://doi.org/10.1007/978-3-642-21437-0_22openalex-snapshot
Termination without $\checkmark$ in CSP
inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_20openalex-snapshot
Isabelle/Circus: A Process Specification and Verification Environment
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_6openalex-snapshot
Constructive Development of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_3openalex-snapshot
Circus Time with Reactive Designs
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_22openalex-snapshot
Reactive Designs of Interrupts in Circus Time
inferred← citeshttps://doi.org/10.1007/978-3-642-39721-9_3openalex-snapshot
Unifying Theories of Programming in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_34openalex-snapshot
Probabilistic Program Analysis with Martingales
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_15openalex-snapshot
A UTP Semantics for Communicating Processes with Shared Variables
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.12.027openalex-snapshot
Supporting ArcAngel in ProofPower
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.11.004openalex-snapshot
Introducing concurrency in sequential Java via laws
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.02.017openalex-snapshot
Unifying theories of time with generalised reactive processes
inferred← citeshttps://doi.org/10.1016/j.jksuci.2023.02.002openalex-snapshot
An incremental approach to the n-queen problem with polynomial time
inferred← citeshttps://doi.org/10.1016/j.scico.2010.02.010openalex-snapshot
Mechanical reasoning about families of UTP theories
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.031openalex-snapshot
A theory of software product line refinement
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.05.008openalex-snapshot
Specifying termination in CSP
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.008openalex-snapshot
Angelic processes for CSP via the UTP
inferred← citeshttps://doi.org/10.1109/access.2023.3316031openalex-snapshot
Is Formal Verification of seL4 Adequate to Address the Key Security Challenges of Kernel Design?
inferred← citeshttps://doi.org/10.1109/tase.2013.18openalex-snapshot
Designs with Angelic Nondeterminism
inferred← citeshttps://doi.org/10.1145/3071178.3071224openalex-snapshot
Counterexample-driven genetic programming
inferred← citeshttps://doi.org/10.11606/t.55.2019.tde-04012019-112931openalex-snapshot
Formal mutation testing in Circus process algebra
inferred← citeshttps://doi.org/10.30534/ijatcse/2019/1681.42019openalex-snapshot
A Survey on Refinement in Formal Methods and Software Engineering
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.