메뉴 건너뛰기




Volumn 277, Issue 1-2, 2002, Pages 47-103

Constructive design of a hierarchy of semantics of a transition system by abstract interpretation

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; APPROXIMATION THEORY; COMPUTER PROGRAMMING LANGUAGES; TRANSFER FUNCTIONS;

EID: 0037188218     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00313-3     Document Type: Conference Paper
Times cited : (139)

References (54)
  • 7
    • 85034422250 scopus 로고
    • Semantics of nondeterministic and noncontinuous constructs
    • F.L. Bauer, M. Broy (Eds.), Program Construction, Lecture Notes of the International Summer School on Program Construction, Marktoberdorf 1978, Springer, Berlin, Germany
    • (1979) Lecture Notes in Computer Science , vol.69 , pp. 553-592
    • Broy, M.1    Gnatz, R.2    Wirsing, M.3
  • 18
    • 0028196382 scopus 로고
    • Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper
    • Toulouse, France, 16-19 May, IEEE Computer Society Press, Los Alamitos, CA
    • (1994) Proc. 1994 Internat. Conf. on Computer Languages , pp. 95-112
    • Cousot, P.1    Cousot, R.2
  • 19
    • 84947934484 scopus 로고
    • Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form, invited paper
    • P. Wolper (Ed.), Proc. 7th Internat. Conf. on Computer Aided Verification, CAV'95, Liège, Belgium, Springer, Berlin, Germany, 3-5 July
    • (1995) Lecture Notes in Computer Science , vol.939 , pp. 293-308
    • Cousot, P.1    Cousot, R.2
  • 29
    • 84947919083 scopus 로고    scopus 로고
    • Completeness in abstract interpretation: A domain perspective
    • M. Johnson (Ed.), Proc. 6th Internat. Conf. on Algebraic Methodology and Software Technology, AMAST'97, Sydney, Australia, Springer, Berlin, Germany, 13-18, December
    • (1997) Lecture Notes in Computer Science , vol.1349 , pp. 231-245
    • Giacobazzi, R.1    Ranzato, F.2
  • 40
  • 42
    • 0008849263 scopus 로고
    • Proofs of algorithms by general snapshots
    • (1966) BIT , vol.6 , pp. 310-316
    • Naur, P.1
  • 44
    • 0000998574 scopus 로고
    • Correspondence between operational and denotational semantics: The full abstraction problem for PCF
    • S. Abramsky, D.M. Gabbay, T.S.E. Maibaum (Eds.), Semantic Modelling, Clarendon Press, Oxford, UK, Chapter 3
    • (1995) Handbook of Logic in Computer Science , vol.4 , pp. 269-356
    • Ong, C.-H.L.1
  • 45
    • 0014651649 scopus 로고
    • Fixpoint, induction and proofs of program properties
    • B. Meltzer, D. Michie (Eds.), Edinburgh University Press, Edinburgh, Scotland
    • (1969) Machine Intelligence , vol.5
    • Park, D.1
  • 46
    • 2542527603 scopus 로고
    • On the semantics of fair parallelism
    • D. Bjørner (Ed.), Proc. Winter School on Abstract Software Specifications, Springer, Berlin, Germany
    • (1980) Lecture Notes in Computer Science , vol.86 , pp. 504-526
    • Park, D.1
  • 50
  • 53
    • 84919345149 scopus 로고
    • The linear time - Branching time spectrum (extended abstract)
    • J.C.M. Baeten, J.W. Klop (Eds.), Proc. CONCUR'90, Theories of Concurrency: Unification and Extension, Amsterdam, August 1990, Springer Berlin, Germany
    • (1990) Lecture Notes in Computer Science , vol.458 , pp. 278-297
    • Van Glabbeek, R.J.1
  • 54


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.