Travelled to:
1 × Chile
1 × France
1 × Germany
1 × Greece
12 × USA
2 × United Kingdom
Collaborated with:
∅ J.G.Riecke J.Chirimar V.Tannen A.Scedrov T.Jim V.Gehlot A.Jung K.Bhargavan D.Rémy M.V.Inwegen S.Chandra P.J.McCann E.L.Gunter M.Jackson P.Zave T.Coquand M.W.Hicks P.Kakkar J.T.Moore S.Nettles M.Kim I.Lee D.Obradovic O.Sokolsky M.Viswanathan A.Zhang A.Goyal W.Kong H.Deng A.Dong Y.Chang J.Han
Talks about:
network (3) languag (3) domain (3) coercion (2) abstract (2) general (2) packet (2) proof (2) determinist (1) interpret (1)
Person: Carl A. Gunter
DBLP: Gunter:Carl_A=
Contributed to:
Wrote 18 papers:
- SIGIR-2015-ZhangGKDDCGH #adaptation #feedback #named #query
- adaQAC: Adaptive Query Auto-Completion via Implicit Negative Feedback (AZ, AG, WK, HD, AD, YC, CAG, JH), pp. 143–152.
- ECOOP-2003-Gunter #api #embedded #security
- Open APIs for Embedded Security (CAG), pp. 225–247.
- POPL-2001-BhargavanCMG #automaton #monitoring #network #what
- What packets may come: automata for network monitoring (KB, SC, PJM, CAG), pp. 206–219.
- ICRE-2000-GunterGJZ #requirements
- A Reference Model for Requirements and Specifications-Extended Abstract (CAG, ELG, MJ, PZ), p. 189.
- ISSTA-2000-BhargavanGKLOSV #analysis #formal method #named #network #simulation
- Verisim: Formal analysis of network simulations (KB, CAG, MK, IL, DO, OS, MV), pp. 2–13.
- POPL-2000-GunterJ
- Generalized Certificate Revocation (CAG, TJ), pp. 316–329.
- ICFP-1998-HicksKMGN #named #network
- PLAN: A Packet Language for Active Networks (MWH, PK, JTM, CAG, SN), pp. 86–93.
- FSE-1996-Gunter #dependence
- Abstracting Dependencies between Software Configuration Items (CAG), pp. 167–178.
- FPCA-1995-GunterRR #exception
- A Generalization of Exceptions and Control in ML-like Languages (CAG, DR, JGR), pp. 12–23.
- CADE-1992-ChirimarGI #interface #named #performance #proving #visual notation
- Xpnet: A Graphical Interface to Proof Nets with an Efficient Proof Checker (JC, CAG, MVI), pp. 711–715.
- LFP-1992-ChirimarGR #invariant #linear #logic #memory management #proving
- Proving Memory Management Invariants for a Language Based on Linear Logic (JC, CAG, JGR), pp. 139–150.
- LFP-1990-TannenGS
- Computing with Coercions (VT, CAG, AS), pp. 44–60.
- LICS-1990-GehlotG #process
- Normal Process Representatives (VG, CAG), pp. 200–207.
- POPL-1990-Gunter #correctness #nondeterminism #source code
- Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs (CAG), pp. 306–319.
- LICS-1989-Breazu-TannenCGS #inheritance
- Inheritance and Explicit Coercion (VT, TC, CAG, AS), pp. 112–129.
- LICS-1988-GunterJ #consistency
- Coherence and Consistency in Domains (CAG, AJ), pp. 309–317.
- LICS-1986-Gunter #axiom
- The Largest First-Order-Axiomatizable Cartesian Closed Category of Domains (CAG), pp. 142–148.
- ICALP-1985-Gunter
- A Universal Domain Technique for Profinite Posets (CAG), pp. 232–243.