Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Albert John Camilleri

dblp:19/573 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 87% Processor architecture and microarchitecture · 13%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 87% Concurrent programming · 13%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
hardware verification		 0.011998
A Role for Theorem Proving in Multi-Processor Design · CAV 1998
Electronic design automation › hardware verification and test › formal verification
theorem proving		 0.011998
A Role for Theorem Proving in Multi-Processor Design · CAV 1998
Programming languages and type systems
language semantics		 0.011990
Mechanizing CSP Trace Theory in Higher Order Logic · IEEE Trans. Software Eng. 1990
Programming languages and type systems › language semantics
trace semantics		 0.011990
Mechanizing CSP Trace Theory in Higher Order Logic · IEEE Trans. Software Eng. 1990
Automated reasoning and model checking
theorem proving		 0.011990
Mechanizing CSP Trace Theory in Higher Order Logic · IEEE Trans. Software Eng. 1990
Processor architecture and microarchitecture › multiprocessor architecture
multiprocessor design		 0.011998
A Role for Theorem Proving in Multi-Processor Design · CAV 1998
Concurrent programming › concurrency theory › process calculi
communicating sequential processes		 0.011990
Mechanizing CSP Trace Theory in Higher Order Logic · IEEE Trans. Software Eng. 1990

Methods — techniques the papers use, named apart from their topics

theorem proving · 0.0semantic definition · 0.0natural-deduction proof · 0.0
YearPublicationVenuePosition
1998 A Role for Theorem Proving in Multi-Processor Design
Albert John Camilleri
 CAV1
1990 Mechanizing CSP Trace Theory in Higher Order Logic
abstract
How a mechanized tool for reasoning about CSP (communicating sequential processes) can be developed by customizing an existing general-purpose theorem prover based on higher-order logic is described. How the trace semantics of CSP operators can be mechanized in higher-order logic is investigated, and how the laws associated with these operators can be proved from their semantic definitions is shown. The resulting system is one in which natural-deduction style proofs can be conducted using the standard CSP laws.>
Albert John Camilleri
 IEEE Trans. Software Eng.1