메뉴 건너뛰기




Volumn 60, Issue 2, 2013, Pages

Relational transducers for declarative networking

Author keywords

Cloud programming; Distributed database; Expressive power; Monotonicity; Relational transducer

Indexed keywords

COMPUTATION MODEL; DECLARATIVE NETWORKINGS; DISTRIBUTED DATABASE; EXPRESSIVE POWER; FORMAL DEFINITION; MONOTONICITY; SEMANTIC PROPERTIES;

EID: 84877880676     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2450142.2450151     Document Type: Conference Paper
Times cited : (43)

References (32)
  • 3
    • 0040666783 scopus 로고
    • Fundamental properties of deterministic and nondeterministic extensions of datalog
    • ABITEBOUL, S. AND SIMON, E. 1991. Fundamental properties of deterministic and nondeterministic extensions of datalog. Theor. Comput. Sci. 78, 137-158.
    • (1991) Theor. Comput. Sci. , vol.78 , pp. 137-158
    • Abiteboul, S.1    Simon, E.2
  • 4
    • 0026204067 scopus 로고
    • Datalog extensions for database queries and updates
    • ABITEBOUL, S. AND VIANU, V. 1991a. Datalog extensions for database queries and updates. J. Comput. Syst. Sci. 43, 62-124.
    • (1991) J. Comput. Syst. Sci. , vol.43 , pp. 62-124
    • Abiteboul, S.1    Vianu, V.2
  • 6
    • 0029293750 scopus 로고
    • Computing with first-order logic
    • ABITEBOUL, S. AND VIANU, V. 1995. Computing with first-order logic. J. Comput. Syst. Sci. 50, 2, 309-335.
    • (1995) J. Comput. Syst. Sci. , vol.50 , Issue.2 , pp. 309-335
    • Abiteboul, S.1    Vianu, V.2
  • 14
    • 0000627069 scopus 로고
    • Appraising fairness in languages for distrubuted programming
    • APT, K. R., FRANCEZ, N., AND KATZ, S. 1988. Appraising fairness in languages for distrubuted programming. Distrib. Comput. 2, 4, 226-241.
    • (1988) Distrib. Comput. , vol.2 , Issue.4 , pp. 226-241
    • Apt, K.R.1    Francez, N.2    Katz, S.3
  • 16
    • 0037052275 scopus 로고    scopus 로고
    • Abstract state machines and computationally complete query languages
    • BLASS, A., GUREVICH, Y., AND VAN DEN BUSSCHE, J. 2002. Abstract state machines and computationally complete query languages. Inf. Comput. 174, 1, 20-36.
    • (2002) Inf. Comput. , vol.174 , Issue.1 , pp. 20-36
    • Blass, A.1    Gurevich, Y.2    Van Den Bussche, J.3
  • 18
    • 33845938560 scopus 로고    scopus 로고
    • Specification and verification of data-driven web applications
    • DEUTSCH, A., SUI, L., AND VIANU, V. 2007. Specification and verification of data-driven web applications. J. Comput. Syst. Sci. 73, 3, 442-474.
    • (2007) J. Comput. Syst. Sci. , vol.73 , Issue.3 , pp. 442-474
    • Deutsch, A.1    Sui, L.2    Vianu, V.3
  • 21
    • 0003974004 scopus 로고
    • Springer, New York
    • FRANCEZ, N. 1986. Fairness. Springer, New York.
    • (1986) Fairness
    • Francez, N.1
  • 22
    • 85027830059 scopus 로고
    • Notes on database operating systems
    • Lecture Notes in Computer Science Springer
    • GRAY, J. 1978. Notes on database operating systems. In An Advanced Course-Operating Systems, Lecture Notes in Computer Science, vol. 60, Springer, 393-481.
    • (1978) An Advanced Course-Operating Systems , vol.60 , pp. 393-481
    • Gray, J.1
  • 25
    • 77956999861 scopus 로고    scopus 로고
    • The declarative imperative: Experiences and conjectures in distributed logic
    • HELLERSTEIN, J. M. 2010b. The declarative imperative: Experiences and conjectures in distributed logic. SIGMOD Rec. 39, 1, 5-19.
    • (2010) SIGMOD Rec. , vol.39 , Issue.1 , pp. 5-19
    • Hellerstein, J.M.1
  • 26
    • 0034316809 scopus 로고    scopus 로고
    • Fairness and hyperfairness
    • LAMPORT, L. 2000. Fairness and hyperfairness. Distrib. Comput. 13, 4, 239-245.
    • (2000) Distrib. Comput. , vol.13 , Issue.4 , pp. 239-245
    • Lamport, L.1
  • 29
    • 84859574026 scopus 로고    scopus 로고
    • Maintaining distributed logic programs incrementally
    • NIGAM, V., JIA, L., LOO, B. T., AND SCEDROV, A. 2012. Maintaining distributed logic programs incrementally. Comput. Lang. Syst. Struct. 38, 2, 158-180.
    • (2012) Comput. Lang. Syst. Struct. , vol.38 , Issue.2 , pp. 158-180
    • Nigam, V.1    Jia, L.2    Loo, B.T.3    Scedrov, A.4
  • 30
    • 0037591752 scopus 로고    scopus 로고
    • Verification of relational transducers for electronic commerce
    • SPIELMANN, M. 2003. Verification of relational transducers for electronic commerce. J. Comput. Syst. Sci. 66, 1, 40-65.
    • (2003) J. Comput. Syst. Sci. , vol.66 , Issue.1 , pp. 40-65
    • Spielmann, M.1
  • 31
    • 22044442681 scopus 로고    scopus 로고
    • Converting untyped formulas into typed ones
    • VAN DEN BUSSCHE, J. AND CABIBBO, L. 1998. Converting untyped formulas into typed ones. Acta Inf. 35, 8, 637-643.
    • (1998) Acta Inf. , vol.35 , Issue.8 , pp. 637-643
    • Van Den Bussche, J.1    Cabibbo, L.2


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