PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A finitary version of the calculus of partial inductive definitions
ELP'91 Conference Proceedings on Extensions of logic programming
Unification under a mixed prefix
Journal of Symbolic Computation
A calculus of mobile processes, II
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
A symbolic semantics for the &pgr;-calculus
Information and Computation
Cut-elimination for a logic with definitions and induction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Foundational aspects of syntax
ACM Computing Surveys (CSUR)
&pgr;-calculus in (Co)inductive-type theory
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
Proceedings of the 17th International Conference on Logic Programming
Final semantics for the pi-calculus
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Proof Theory for Generic Judgments: An extended abstract
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A logical framework for reasoning about logical specifications
A logical framework for reasoning about logical specifications
A treatment of higher-order features in logic programming
Theory and Practice of Logic Programming
Relating State-Based and Process-Based Concurrency through Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
On the Role of Names in Reasoning about λ-tree Syntax Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof search specifications of bisimulation and modal logics for the π-calculus
ACM Transactions on Computational Logic (TOCL)
Information and Computation
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
We present a meta-logic that contains a new quantifier @? (for encoding ''generic judgments'') and inference rules for reasoning within fixed points of a given specification. We then specify the operational semantics and bisimulation relations for the finite @p-calculus within this meta-logic. Since we restrict to the finite case, the ability of the meta-logic to reason within fixed points becomes a powerful and complete tool since simple proof search can compute this one fixed point. The @? quantifier helps with the delicate issues surrounding the scope of variables within @p-calculus expressions and their executions (proofs). We shall illustrate several merits of the logical specifications we write: they are natural and declarative; they contain no side conditions concerning names of variables while maintaining a completely formal treatment of such variables; differences between late and open bisimulation relations are easy to see declaratively; and proof search involving the application of inference rules, unification, and backtracking can provide complete proof systems for both one-step transitions and for bisimulation.