Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Complejidad programa")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 313

  • Page / 13
Export

Selection :

  • and

An approach to understanding program comprehensibility using spatial complexity, concept assignment and typographical styleMOHAN, Andrew; GOLD, Nicolas; LAYZELL, Paul et al.International Conference on Software Maintenance. 2004, isbn 0-7695-2213-0, p. 530Conference Paper

On generalizations of semi-terms of particularly simple formBAAZ, Matthias; MOSER, Georg.Lecture notes in computer science. 2002, pp 382-396, issn 0302-9743, isbn 3-540-44240-5, 15 p.Conference Paper

Fixed-parameter complexity of semantics for logic programsLONC, Zbigniew; TRUSZCZYNSKI, Miroslaw.Lecture notes in computer science. 2001, pp 197-211, issn 0302-9743, isbn 3-540-42935-2Conference Paper

An initial approach to assessing program comprehensibility using spatial complexity, number of concepts and typographical styleMOHAN, Andrew; GOLD, Nicolas; LAYZELL, Paul et al.Working conference on reverse engineering. 2004, pp 246-255, isbn 0-7695-2243-2, 1Vol, 10 p.Conference Paper

Axiomatizing software test data adequacyWEYUKER, E. J.IEEE transactions on software engineering. 1986, Vol 12, Num 12, pp 1128-1138, issn 0098-5589Article

Renaming a set of non-horn clausesNIE, X; GUO, Q.Lecture notes in computer science. 1997, pp 600-608, issn 0302-9743, isbn 3-540-63614-5Conference Paper

New conditions for the existence of least generalizations under relative subsumptionYAMAMOTO, A.Lecture notes in computer science. 2000, pp 253-264, issn 0302-9743, isbn 3-540-67795-XConference Paper

Composing general logic programsBROGI, A; CONTIERO, S; TURINI, F et al.Lecture notes in computer science. 1997, pp 273-288, issn 0302-9743, isbn 3-540-63255-7Conference Paper

On acyclic and head-cycle free nested logic programsLINKE, Thomas; TOMPITS, Hans; WOLTRAN, Stefan et al.Lecture notes in computer science. 2004, pp 225-239, issn 0302-9743, isbn 3-540-22671-0, 15 p.Conference Paper

Consequences of Jacopini's theorem : Consistent equalities and equationsSTATMAN, R.Lecture notes in computer science. 1999, pp 355-364, issn 0302-9743, isbn 3-540-65763-0Conference Paper

A fixpoint semantics for reasoning about finite failureGORI, R.Lecture notes in computer science. 1999, pp 238-257, issn 0302-9743, isbn 3-540-66492-0Conference Paper

Static analysis of mega-programsWEISE, D.Lecture notes in computer science. 1999, pp 300-302, issn 0302-9743, isbn 3-540-66459-9Conference Paper

LPNMR '97 : logic programming and nonmonotonic reasoning (Dagstuhl Castle, July 28-31, 1997)Dix, Jürgen; Furbach, Ulrich; Nerode, Anil et al.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63255-7, X, 452 p, isbn 3-540-63255-7Conference Proceedings

Integrating an entry consistency memory model and concurrent object-oriented programmingNEBRO, A. J; PIMENTEL, E; TROYA, J. M et al.Lecture notes in computer science. 1997, pp 567-571, issn 0302-9743, isbn 3-540-63440-1Conference Paper

LISP program-size complexityCHAITIN, G. J.Applied mathematics and computation. 1992, Vol 49, Num 1, pp 79-93, issn 0096-3003Article

Properties of control-flow complexity measuresLAKSHMANAN, K. B; JAYAPRAKASH, S; SINHA, P. K et al.IEEE transactions on software engineering. 1991, Vol 17, Num 12, pp 1289-1295, issn 0098-5589Article

On Weyuker's axioms for software complexity measuresCHERNIAVSKY, J. C; SMITH, C. H.IEEE transactions on software engineering. 1991, Vol 17, Num 6, pp 636-638, issn 0098-5589Article

Meta-complexity theorems : Talk AbstractMCALLESTER, David.Lecture notes in computer science. 2000, pp 13-17, issn 0302-9743, isbn 3-540-41053-8Conference Paper

Fast rewriting of symmetric polynomialsGÖBEL, M.Lecture notes in computer science. 1999, pp 371-381, issn 0302-9743, isbn 3-540-66201-4Conference Paper

An abductive semantics for disjunctive logic programs and its proof procedureYOU, J.-H; LI YAN YUAN; GOEBEL, R et al.Lecture notes in computer science. 1997, pp 138-152, issn 0302-9743, isbn 3-540-63876-8Conference Paper

Rigorous definition and analysis of program complexity measures: an example using nestingHOWATT, J. W; BAKER, A. L.The Journal of systems and software. 1989, Vol 10, Num 2, pp 139-150, issn 0164-1212Article

Automating program analysisHICKEY, T; COHEN, J.Journal of the Association for Computing Machinery. 1988, Vol 35, Num 1, pp 185-220, issn 0004-5411Article

Characterizing the software development process: A new approach based on Kolmogorov complexityCAMPANI, Carlos A. P; BLAUTH MENEZES, Paulo.Lecture notes in computer science. 2001, pp 242-256, issn 0302-9743, isbn 3-540-42959-XConference Paper

Fully consistent extensions of partially defined Boolean functions with missing bitsBOROS, E; IBARAKI, T; MAKINO, K et al.Lecture notes in computer science. 2000, pp 257-272, issn 0302-9743, isbn 3-540-67823-9Conference Paper

Matching specifications for message sequence chartsMUSCHOLL, A.Lecture notes in computer science. 1999, pp 273-287, issn 0302-9743, isbn 3-540-65719-3Conference Paper

  • Page / 13